Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
88 | Wonil Lee, Kouichi Sakurai, Seokhie Hong, Sangjin Lee 0002 |
On the Pseudorandomness of a Modification of KASUMI Type Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICISC ![In: Information Security and Cryptology - ICISC 2004, 7th International Conference, Seoul, Korea, December 2-3, 2004, Revised Selected Papers, pp. 313-329, 2004, Springer, 3-540-26226-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
KASUMI, block cipher, provable security, Pseudorandomness |
67 | Henri Gilbert, Marine Minier |
New Results on the Pseudorandomness of Some Blockcipher Constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSE ![In: Fast Software Encryption, 8th International Workshop, FSE 2001 Yokohama, Japan, April 2-4, 2001, Revised Papers, pp. 248-266, 2001, Springer, 3-540-43869-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
63 | Wenling Wu |
Pseudorandomness of Camellia-Like Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 21(1), pp. 82-88, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
random function, super-pseudorandomness, block cipher, pseudorandomness, Camellia |
57 | Wenling Wu, Dengguo Feng, Hua Chen 0011 |
Collision Attack and Pseudorandomness of Reduced-Round Camellia. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography, 11th International Workshop, SAC 2004, Waterloo, Canada, August 9-10, 2004, Revised Selected Papers, pp. 252-266, 2004, Springer, 3-540-24327-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Block cipher, Time complexity, Pseudorandomness, Data complexity, Camellia |
47 | Jacques Patarin |
About Feistel Schemes with Six (or More) Rounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSE ![In: Fast Software Encryption, 5th International Workshop, FSE '98, Paris, France, March 23-25, 1998, Proceedings, pp. 103-121, 1998, Springer, 3-540-64265-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
42 | Amparo Fúster-Sabater, Pino Caballero-Gil, Oscar Delgado-Mohatar |
Deterministic Computation of Pseudorandomness in Sequences of Cryptographic Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (1) ![In: Computational Science - ICCS 2009, 9th International Conference, Baton Rouge, LA, USA, May 25-27, 2009, Proceedings, Part I, pp. 621-630, 2009, Springer, 978-3-642-01969-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bit-string, run dirtribution, cryptography, Pseudorandomness, balancedness |
41 | Manindra Agrawal, Diptarka Chakraborty, Debarati Das 0001, Satyadev Nandakumar |
Dimension, pseudorandomness and extraction of pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. ![In: Comput. 6(3), pp. 277-305, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
41 | Manindra Agrawal, Diptarka Chakraborty, Debarati Das 0001, Satyadev Nandakumar |
Dimension, Pseudorandomness and Extraction of Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2015, December 16-18, 2015, Bangalore, India, pp. 221-235, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-97-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
41 | Manindra Agrawal, Diptarka Chakraborty, Debarati Das 0001, Satyadev Nandakumar |
Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR14, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
37 | Jin-yi Cai, Hong Zhu 0004 |
Progress in Computational Complexity Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 20(6), pp. 735-750, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worst-case to average-case reductions, extractors, pseudorandomness, inapproximability, primality testing, theoretical computer science, holographic algorithms |
37 | Serge Vaudenay |
Decorrelation: A Theory for Block Cipher Security. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 16(4), pp. 249-286, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Cryptanalysis, Block ciphers, Pseudorandomness |
37 | Tetsu Iwata, Tomonobu Yoshino, Kaoru Kurosawa |
Non-cryptographic Primitive for Pseudorandom Permutation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSE ![In: Fast Software Encryption, 9th International Workshop, FSE 2002, Leuven, Belgium, February 4-6, 2002, Revised Papers, pp. 149-163, 2002, Springer, 3-540-44009-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
MISTY type permutation, Block cipher, pseudorandomness |
37 | Matthias Krause 0001, Stefan Lucks |
On the Minimal Hardware Complexity of Pseudorandom Function Generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 419-430, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Boolean Complexity Theory, Computational Distinguishability, Cryptography, Pseudorandomness |
37 | Matt Blaze, Joan Feigenbaum, Moni Naor |
A Formal Treatment of Remotely Keyed Encryption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding, pp. 251-265, 1998, Springer, 3-540-64518-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Remotely Keyed Encryption, Smart-cards, Block Ciphers, Pseudorandomness, Session Keys |
37 | Adam L. Young, Moti Yung |
Kleptography: Using Cryptography Against Cryptography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '97, International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, May 11-15, 1997, Proceeding, pp. 62-74, 1997, Springer, 3-540-62975-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Cryptanalytic attacks, leakage bandwidth, design and manufacturing of cryptographic devices and software, black-box devices, SETUP mechanisms, RSA, randomness, information hiding, pseudorandomness, Diffie-Hellman, subliminal channels, kleptography, Discrete Log |
37 | Adam L. Young, Moti Yung |
The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '97, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 1997, Proceedings, pp. 264-276, 1997, Springer, 3-540-63384-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
DSA signature, Menezes-Vanstone PKCS, Schnorr signature algorithm, protocol abuse, leakage-bandwidth, cryptographic system implementations, randomness, pseudorandomness, Diffie-Hellman, subliminal channels, kleptography, setup, ElGamal encryption, ElGamal signature, Discrete-Log |
37 | Adam L. Young, Moti Yung |
The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '96, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 1996, Proceedings, pp. 89-103, 1996, Springer, 3-540-61512-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Cryptanalytic attacks, Private key, applied systems, design and manufacturing of cryptographic devices and software, auto-escrowing keys, software, RSA, randomness, hardware, Public Key, pseudorandomness, Kerberos, key escrow, DSA, ElGamal, subliminal channels, Capstone |
36 | Luca Trevisan, Salil P. Vadhan |
Pseudorandomness and Average-Case Complexity Via Uniform Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(4), pp. 331-364, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Subject classification, 68Q10 |
36 | Tetsu Iwata, Tohru Yagi, Kaoru Kurosawa |
On the Pseudorandomness of KASUMI Type Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 8th Australasian Conference, ACISP 2003, Wollongong, Australia, July 9-11, 2003, Proceedings, pp. 130-141, 2003, Springer, 3-540-40515-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Luca Trevisan, Salil P. Vadhan |
Pseudorandomness and Average-Case Complexity via Uniform Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 129-138, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Salil P. Vadhan |
Order in Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings, pp. 10-11, 2001, Springer, 3-540-42470-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Ju-Sung Kang, Okyeon Yi, Dowon Hong, Hyun Sook Cho |
Pseudorandomness of MISTY-Type Transformations and the Block Cipher KASUMI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 6th Australasian Conference, ACISP 2001, Sydney, Australia, July 11-13, 2001, Proceedings, pp. 60-73, 2001, Springer, 3-540-42300-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
(Super-)Pseudorandom permutation ensemble, MISTY-type transformation, KASUMI, Distinguisher |
36 | Eonkyung Lee, Sangjin Lee, Sang Geun Hahn |
Pseudorandomness from Braid Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings, pp. 486-502, 2001, Springer, 3-540-42456-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Scott Aaronson |
BQP and the polynomial hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 141-150, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
linial-nisan conjecture, quantum complexity classes, fourier analysis, constant-depth circuits |
31 | Marc Fischlin, Anja Lehmann |
Multi-property Preserving Combiners for Hash Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008., pp. 375-392, 2008, Springer, 978-3-540-78523-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Dengguo Feng, Weidong Chen |
Modular approach to the design and analysis of password-based security protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 50(3), pp. 381-398, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
weak computational indistinguishability, random oracle model (ROM), provable security, security protocols, standard model |
31 | Yi Deng 0002, Dongdai Lin |
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings, pp. 148-168, 2007, Springer, 978-3-540-72539-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
instance-dependent verifiable random functions, simultaneous resettability, zero knowledge |
31 | Rudolf Ahlswede, Christian Mauduit, András Sárközy |
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GTIT-C ![In: General Theory of Information Transfer and Combinatorics, pp. 293-307, 2006, Springer, 3-540-46244-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang |
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2006, 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, December 3-7, 2006, Proceedings, pp. 194-209, 2006, Springer, 3-540-49475-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Babak Sadeghiyan, Josef Pieprzyk |
On Necessary and Sufficient Conditions for the Construction of Super Pseudorandom Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT '91, International Conference on the Theory and Applications of Cryptology, Fujiyoshida, Japan, November 11-14, 1991, Proceedings, pp. 194-209, 1991, Springer, 3-540-57332-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
21 | Matt DeVos, Ariel Gabizon |
Simple Affine Extractors Using Dimension Expansion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 50-57, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
affine extractors, dimension expansion, derandomization, Extractors, pseudorandomness |
21 | Liting Zhang, Wenling Wu, Lei Zhang 0012, Yanjun Li |
A note on Cook's elastic block cipher. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AsiaCCS ![In: Proceedings of the 2009 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2009, Sydney, Australia, March 10-12, 2009, pp. 380-383, 2009, ACM, 978-1-60558-394-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
elastic block cipher, variable-input-length block cipher, encryption, block cipher, security model, pseudorandomness |
21 | Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola |
Bounded Independence Fools Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 171-180, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
k-wise independent distributions, pseudorandomness, halfspaces |
21 | Jesse Kamp, Anup Rao 0001, Salil P. Vadhan, David Zuckerman |
Deterministic extractors for small-space sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 691-700, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
pseudorandomness, randomness extractors |
21 | Rosario Gennaro |
An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 18(2), pp. 91-110, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Discrete logarithm, Pseudorandomness |
21 | Ran Raz |
Extractors with weak random seeds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 11-20, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
random sources, extractors, pseudorandomness, condensers, mergers, randomness extraction, explicit constructions, Ramsey graphs |
21 | Andrej Bogdanov |
Pseudorandom generators for low degree polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 21-30, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
derandomization, pseudorandomness |
21 | Venkatesan Guruswami |
Better extractors for better codes? ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 436-444, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
error-correcting codes, expander graphs, pseudorandomness, list decoding, randomness extractors |
21 | Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson |
Extractors: optimal up to constant factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 602-611, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
locally decodable error-correcting codes, pseudorandomness, condensers, randomness extractors, mergers |
21 | Matthias Krause 0001, Stefan Lucks |
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 10(4), pp. 297-313, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
$ textit{TC}^{0} $, lower bounds.¶ Subject classification. 68Q25, Pseudorandomness, 94A60, function generators |
21 | Luca Trevisan |
Extractors and pseudorandom generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(4), pp. 860-879, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Error-correcting codes, extractors, pseudorandomness |
21 | Johan Håstad, Avi Wigderson |
Simple Analysis of Graph Tests for Linearity and PCP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 244-254, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
graph test, pseudorandomness, PCP, Linearity testing, iterated test |
21 | Peter Auer, Philip M. Long, Aravind Srinivasan |
Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997, pp. 314-323, 1997, ACM, 0-89791-888-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
approximations of distributions, machine learning, random graphs, derandomization, pseudorandomness, PAC learning, multiple-instance learning, rectangles, sample complexity, explicit constructions, Ramsey graphs |
21 | Samuel Bouaziz-Ermann, Garazi Muguruza |
Quantum Pseudorandomness Cannot Be Shrunk In a Black-Box Way. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.13324, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Samuel Bouaziz-Ermann, Garazi Muguruza |
Quantum Pseudorandomness Cannot Be Shrunk In a Black-Box Way. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2024, pp. 291, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
21 | Iddo Tzameret, Luming Zhang |
Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA, pp. 95:1-95:22, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-309-6. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Yong Wang 0009, Zhuo Liu, Leo Yu Zhang, Fabio Pareschi, Gianluca Setti, Guanrong Chen |
From Chaos to Pseudorandomness: A Case Study on the 2-D Coupled Map Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Cybern. ![In: IEEE Trans. Cybern. 53(2), pp. 1324-1334, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Iddo Tzameret, Luming Zhang |
Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
21 | Iddo Tzameret, Luming Zhang |
Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.14700, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Tudor Giurgica-Tiron, Adam Bouland |
Pseudorandomness from Subset States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.09206, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Maxime Bombar, Geoffroy Couteau, Alain Couvreur, Clément Ducros |
Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.03488, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Emile Anand, Chris Umans |
Pseudorandomness of the Sticky Random Walk. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.11104, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Amit Behera, Zvika Brakerski, Or Sattath, Omri Shmueli |
Pseudorandomness with Proof of Destruction and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2023, pp. 543, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
21 | Rupeng Yang |
Privately Puncturing PRFs from Lattices: Adaptive Security and Collusion Resistant Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2023, pp. 234, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
21 | Maxime Bombar, Geoffroy Couteau, Alain Couvreur, Clément Ducros |
Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2023, pp. 845, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
21 | Xin Lyu 0003, Weihao Zhu |
Time-Space Tradeoffs for Element Distinctness and Set Intersection via Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 5243-5281, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Amit Behera, Zvika Brakerski, Or Sattath, Omri Shmueli |
Pseudorandomness with Proof of Destruction and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC (4) ![In: Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part IV, pp. 125-154, 2023, Springer, 978-3-031-48623-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard |
Pseudorandomness of Decoding, Revisited: Adapting OHCP to Code-Based Cryptography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT (7) ![In: Advances in Cryptology - ASIACRYPT 2023 - 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4-8, 2023, Proceedings, Part VII, pp. 253-283, 2023, Springer, 978-981-99-8738-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Rupeng Yang |
Privately Puncturing PRFs from Lattices: Adaptive Security and Collusion Resistant Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT (3) ![In: Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III, pp. 163-193, 2023, Springer, 978-3-031-30619-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Cynthia Dwork, Daniel Lee, Huijia Lin, Pranay Tankala |
From Pseudorandomness to Multi-Group Fairness and Back. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: The Thirty Sixth Annual Conference on Learning Theory, COLT 2023, 12-15 July 2023, Bangalore, India., pp. 3566-3614, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
21 | Maxime Bombar, Geoffroy Couteau, Alain Couvreur, Clément Ducros |
Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO (4) ![In: Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part IV, pp. 567-601, 2023, Springer, 978-3-031-38550-6. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman |
Nearly Optimal Pseudorandomness from Hardness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 69(6), pp. 43:1-43:55, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Venkatesan Guruswami, Xin Lyu, Xiuhan Wang |
Range Avoidance for Low-depth Circuits and Connections to Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
21 | Louis Golowich, Salil P. Vadhan |
Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
21 | Xin Lyu 0003, Weihao Zhu |
Time-Space Tradeoffs for Element Distinctness and Set Intersection via Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.07534, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl |
Correlated Pseudorandomness from Expand-Accumulate Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2022, pp. 1014, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
21 | Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard |
On The Pseudorandomness of the Decoding Problem via the Oracle Comparison Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2022, pp. 1751, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
21 | Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett |
High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 1069-1128, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Rahul Ilango, Hanlin Ren, Rahul Santhanam |
Robustness of average-case meta-complexity via pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pp. 1575-1583, 2022, ACM, 978-1-4503-9264-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Venkatesan Guruswami, Xin Lyu, Xiuhan Wang |
Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 20:1-20:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl |
Correlated Pseudorandomness from Expand-Accumulate Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO (2) ![In: Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part II, pp. 603-633, 2022, Springer, 978-3-031-15978-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Louis Golowich, Salil P. Vadhan |
Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 27:1-27:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Sourya Roy |
A Study of Pseudorandomness and its Applications to Coding Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2022 |
RDF |
|
21 | Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan |
Monotone Branching Programs: Pseudorandomness and Circuit Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Mina Doosti, Niraj Kumar, Elham Kashefi, Kaushik Chakraborty |
On the Connection Between Quantum Pseudorandomness and Quantum Hardware Assumptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.11724, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | William Kretschmer |
Quantum Pseudorandomness and Classical Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.09320, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Aayush Jain, Alexis Korb, Paul Lou, Amit Sahai |
A Note on the Pseudorandomness of Low-Degree Polynomials over the Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2021, pp. 1415, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Huaning Liu, Xiaolin Chen |
On pseudorandom subsets in finite fields I: measure of pseudorandomness and support of Boolean functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Period. Math. Hung. ![In: Period. Math. Hung. 83(2), pp. 204-219, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | William Kretschmer |
Quantum Pseudorandomness and Classical Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TQC ![In: 16th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2021, July 5-8, 2021, Virtual Conference., pp. 2:1-2:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-198-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Max Hopkins, Tali Kaufman, Shachar Lovett |
High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR20, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Hassan Aly, Arne Winterhof |
A Note on Hall's Sextic Residue Sequence: Correlation Measure of Order $k$ and Related Measures of Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 66(3), pp. 1944-1947, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Max Hopkins, Tali Kaufman, Shachar Lovett |
High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2011.04658, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Adam Bouland, Bill Fefferman, Umesh V. Vazirani |
Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA., pp. 63:1-63:2, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-134-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Rahul Santhanam |
Pseudorandomness and the Minimum Circuit Size Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA., pp. 68:1-68:26, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-134-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman |
Nearly Optimal Pseudorandomness From Hardness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pp. 1057-1068, 2020, IEEE, 978-1-7281-9621-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Pratik Soni |
Transforming Pseudorandomness and Non-malleability with Minimal Overheads. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2020 |
RDF |
|
21 | Russell Impagliazzo, Raghu Meka, David Zuckerman |
Pseudorandomness from Shrinkage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 66(2), pp. 11:1-11:16, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Rahul Santhanam |
Pseudorandomness and the Minimum Circuit Size Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR19, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman |
Nearly Optimal Pseudorandomness From Hardness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR19, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Tobias Christiani |
Algorithms for Similarity Search and Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1906.09430, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Adam Bouland, Bill Fefferman, Umesh V. Vazirani |
Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1910.14646, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Prabhanjan Ananth, Aayush Jain, Huijia Lin, Christian Matt 0002, Amit Sahai |
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2019, pp. 643, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Emanuele Viola |
Constant-Error Pseudorandomness Proofs from Hardness Require Majority. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Theory ![In: ACM Trans. Comput. Theory 11(4), pp. 19:1-19:11, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Rocco A. Servedio, Li-Yang Tan |
Pseudorandomness for read-k DNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pp. 621-638, 2019, SIAM, 978-1-61197-548-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Prabhanjan Ananth, Aayush Jain, Huijia Lin, Christian Matt 0002, Amit Sahai |
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO (3) ![In: Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part III, pp. 284-332, 2019, Springer, 978-3-030-26953-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | László Mérai, Arne Winterhof |
On the pseudorandomness of automatic sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cryptogr. Commun. ![In: Cryptogr. Commun. 10(6), pp. 1013-1022, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Shuai Han 0001, Shengli Liu 0001, Baodong Qin, Dawu Gu |
Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 86(3), pp. 517-554, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Emanuele Viola |
Constant-error pseudorandomness proofs from hardness require majority. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR18, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
21 | Maciej Skorski |
Pseudorandomness Against Mean and Variance Bounded Attackers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2018, pp. 984, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
21 | Prabhanjan Ananth, Aayush Jain, Dakshita Khurana, Amit Sahai |
Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2018, pp. 615, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|