Skip header Section
Skip Bibliometrics Section
Pseudorandomness and Cryptographic ApplicationsJanuary 1994
- Author:
- Michael George Luby
Skip Abstract Section
Abstract
From the Publisher:
A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs.
Cited By
Peng K Perfect ZK Argument of Knowledge of Discrete Logarithm in A Cyclic Group with Unknown Order Proceedings of the 8th ACM on ASIA Public-Key Cryptography Workshop, (33-40)- Berman I, Haitner I, Komargodski I and Naor M (2019). Hardness-Preserving Reductions via Cuckoo Hashing, Journal of Cryptology, 32:2, (361-392), Online publication date: 1-Apr-2019.
- Zhan F, Zhao Z, Chen Y and Yao N (2019). On the using of Rényi’s quadratic entropy for physical layer key generation, Computer Communications, 137:C, (32-43), Online publication date: 1-Mar-2019.
- Antoniadis K, Blanchard P, Guerraoui R and Stainer J (2018). The entropy of a distributed computation random number generation from memory interleaving, Distributed Computing, 31:5, (389-417), Online publication date: 1-Oct-2018.
- Asharov G and Segev G (2018). On Constructing One-Way Permutations from Indistinguishability Obfuscation, Journal of Cryptology, 31:3, (698-736), Online publication date: 1-Jul-2018.
- L'Ecuyer P History of uniform random number generation Proceedings of the 2017 Winter Simulation Conference, (1-29)
- Gilbert S, Newport C and Zheng C (2017). Who are you? Secure identities in single hop ad hoc networks, Distributed Computing, 30:2, (103-125), Online publication date: 1-Apr-2017.
- Skórski M Simulating Auxiliary Inputs, Revisited Proceedings, Part I, of the 14th International Conference on Theory of Cryptography - Volume 9985, (159-179)
- Skórski M On Provable Security of wPRF-Based Leakage-Resilient Stream Ciphers Proceedings of the 9th International Conference on Provable Security - Volume 9451, (391-411)
- Gilbert S and Zheng C (2015). SybilCast, ACM Transactions on Parallel Computing, 2:3, (1-20), Online publication date: 2-Nov-2015.
- Pietrzak K and Skórski M The Chain Rule for HILL Pseudoentropy, Revisited Proceedings of the 4th International Conference on Progress in Cryptology -- LATINCRYPT 2015 - Volume 9230, (81-98)
- Miranda A, Effert S, Kang Y, Miller E, Popov I, Brinkmann A, Friedetzky T and Cortes T (2014). Random Slicing, ACM Transactions on Storage, 10:3, (1-35), Online publication date: 1-Jul-2014.
- Gilbert S and Zheng C SybilCast Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures, (130-139)
- Berman I, Haitner I, Komargodski I and Naor M Hardness preserving reductions via cuckoo hashing Proceedings of the 10th theory of cryptography conference on Theory of Cryptography, (40-59)
- Ben-David A, Berkman O, Matias Y, Patel S, Paya C and Yung M Contextual OTP Proceedings of the 10th international conference on Applied Cryptography and Network Security, (30-47)
- Jain A, Pietrzak K and Tentes A Hardness preserving constructions of pseudorandom functions Proceedings of the 9th international conference on Theory of Cryptography, (369-382)
- Berman I and Haitner I From non-adaptive to adaptive pseudorandom functions Proceedings of the 9th international conference on Theory of Cryptography, (357-368)
- de Koning Gans G and Verheul E Best effort and practice activation codes Proceedings of the 8th international conference on Trust, privacy and security in digital business, (98-112)
- Chatterjee S, Menezes A and Sarkar P Another look at tightness Proceedings of the 18th international conference on Selected Areas in Cryptography, (293-319)
- Chan A and Castelluccia C (2011). A security framework for privacy-preserving data aggregation in wireless sensor networks, ACM Transactions on Sensor Networks, 7:4, (1-45), Online publication date: 1-Feb-2011.
- Buldas A and Niitsoo M Optimally tight security proofs for hash-then-publish time-stamping Proceedings of the 15th Australasian conference on Information security and privacy, (318-335)
- Lewko A and Waters B Efficient pseudorandom functions from the decisional linear assumption and weaker variants Proceedings of the 16th ACM conference on Computer and communications security, (112-120)
- Dubrova E (2009). A transformation from the Fibonacci to the Galois NLFSRs, IEEE Transactions on Information Theory, 55:11, (5263-5271), Online publication date: 1-Nov-2009.
- Kurosawa K and Takagi T (2009). One-wayness equivalent to general factoring, IEEE Transactions on Information Theory, 55:9, (4249-4262), Online publication date: 1-Sep-2009.
- Buldas A, Jürgenson A and Niitsoo M Efficiency Bounds for Adversary Constructions in Black-Box Reductions Proceedings of the 14th Australasian Conference on Information Security and Privacy, (264-275)
- Cook D, Yung M and Keromytis A Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs Information Security and Cryptology, (157-180)
- Awerbuch B and Scheideler C (2009). Robust random number generation for peer-to-peer systems, Theoretical Computer Science, 410:6-7, (453-466), Online publication date: 20-Feb-2009.
- Backes M, Dürmuth M and Unruh D OAEP Is Secure under Key-Dependent Messages Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (506-523)
- Farashahi R, Pellikaan R and Sidorenko A (2008). Extractors for binary elliptic curves, Designs, Codes and Cryptography, 49:1-3, (171-186), Online publication date: 1-Dec-2008.
- Backes M, Pfitzmann B and Scedrov A (2008). Key-dependent message security under active attacks - BRSIM/UC-soundness of Dolev-Yao-style encryption with key cycles, Journal of Computer Security, 16:5, (497-530), Online publication date: 1-Nov-2008.
- Farashahi R Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves Proceedings of the 13th Australasian conference on Information Security and Privacy, (447-462)
- Patarin J A proof of security in O(2n) for the Benes scheme Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology, (209-220)
- Haitner I, Hoch J and Segev G A linear lower bound on the communication complexity of single-server private information retrieval Proceedings of the 5th conference on Theory of cryptography, (445-464)
- Dubrova E, Teslenko M and Tenhunen H On analysis and synthesis of (n, k)-non-linear feedback shift registers Proceedings of the conference on Design, automation and test in Europe, (1286-1291)
- Farashahi R Extractors for Jacobian of hyperelliptic curves of genus 2 in odd characteristic Proceedings of the 11th IMA international conference on Cryptography and coding, (313-335)
- Farashahi R Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic Cryptography and Coding, (313-335)
- Chan A and Castelluccia C On the privacy of concealed data aggregation Proceedings of the 12th European conference on Research in Computer Security, (390-405)
- Brown D and Gjøsteen K A security analysis of the NIST SP 800-90 elliptic curve random number generator Proceedings of the 27th annual international cryptology conference on Advances in cryptology, (466-481)
- Zhan J, Matwin S and Chang L (2007). Privacy-preserving collaborative association rule mining, Journal of Network and Computer Applications, 30:3, (1216-1227), Online publication date: 1-Aug-2007.
- Farashahi R and Pellikaan R The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic Proceedings of the 1st international workshop on Arithmetic of Finite Fields, (219-236)
- Young A and Yung M Space-efficient kleptography without random oracles Proceedings of the 9th international conference on Information hiding, (112-129)
- Akbarinia R, Pacitti E and Valduriez P Data currency in replicated DHTs Proceedings of the 2007 ACM SIGMOD international conference on Management of data, (211-222)
- Farashahi R, Schoenmakers B and Sidorenko A Efficient pseudorandom generators based on the DDH assumption Proceedings of the 10th international conference on Practice and theory in public-key cryptography, (426-441)
- Awerbuch B and Scheideler C Robust random number generation for peer-to-peer systems Proceedings of the 10th international conference on Principles of Distributed Systems, (275-289)
- Young A and Yung M An elliptic curve backdoor algorithm for RSASSA Proceedings of the 8th international conference on Information hiding, (355-374)
- Jutla C PRF domain extension using DAGs Proceedings of the Third conference on Theory of Cryptography, (561-580)
- Barak B, Lindell Y and Vadhan S (2006). Lower bounds for non-black-box zero knowledge, Journal of Computer and System Sciences, 72:2, (321-391), Online publication date: 1-Mar-2006.
- Patarin J and Montreuil A Benes and butterfly schemes revisited Proceedings of the 8th international conference on Information Security and Cryptology, (92-116)
- Buldas A, Laud P, Saarepera M and Willemson J Universally composable time-stamping schemes with audit Proceedings of the 8th international conference on Information Security, (359-373)
- List B, Maucher M, Schöning U and Schuler R Randomized Quicksort and the Entropy of the Random Source Proceedings of the 11th Annual International Conference on Computing and Combinatorics - Volume 3595, (450-460)
- Hall W and Jutla C Parallelizable authentication trees Proceedings of the 12th international conference on Selected Areas in Cryptography, (95-109)
- Zhan J, Matwin S and Chang L Privacy-Preserving collaborative association rule mining Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security, (153-165)
- Di Crescenzo G and Kiayias A Asynchronous perfectly secure communication over one-time pads Proceedings of the 32nd international conference on Automata, Languages and Programming, (216-227)
- Wee H On obfuscating point functions Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (523-532)
- Lin H, Trevisan L and Wee H On hardness amplification of one-way functions Proceedings of the Second international conference on Theory of Cryptography, (34-49)
- Backes M and Cachin C Public-key steganography with active attacks Proceedings of the Second international conference on Theory of Cryptography, (210-226)
- Vora P Information theory and the security of binary data perturbation Proceedings of the 5th international conference on Cryptology in India, (136-147)
- Cai J and Threlfall R (2004). A note on quadratic residuosity and UP, Information Processing Letters, 92:3, (127-131), Online publication date: 1-Nov-2004.
- Coron J, Naccache D and Kocher P (2004). Statistics and secret leakage, ACM Transactions on Embedded Computing Systems, 3:3, (492-508), Online publication date: 1-Aug-2004.
- Naor M and Reingold O (2004). Number-theoretic constructions of efficient pseudo-random functions, Journal of the ACM, 51:2, (231-262), Online publication date: 1-Mar-2004.
- Young A and Yung M Backdoor attacks on black-box ciphers exploiting low-entropy plaintexts Proceedings of the 8th Australasian conference on Information security and privacy, (297-311)
- Sugita H (2003). Dynamic random Weyl sampling for drastic reduction of randomness in Monte Carlo integration, Mathematics and Computers in Simulation, 62:3-6, (529-537), Online publication date: 3-Mar-2003.
- Chari S, Jutla C, Rao J and Rohatgi P Power analysis Programming methodology, (415-439)
- Pinkas B (2002). Cryptographic techniques for privacy-preserving data mining, ACM SIGKDD Explorations Newsletter, 4:2, (12-19), Online publication date: 1-Dec-2002.
- Bellare (2002). A Note on Negligible Functions, Journal of Cryptology, 15:4, (271-284), Online publication date: 1-Sep-2002.
- Jakobsson M and Juels A An optimally robust hybrid mix network Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, (284-292)
- Naor M Cryptography and mechanism design Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge, (163-167)
- Goldmann M, Näslund M and Russell A (2001). Complexity Bounds on General Hard-Core Predicates, Journal of Cryptology, 14:3, (177-195), Online publication date: 1-Jan-2001.
- Håstad J, Jonsson J, Juels A and Yung M Funkspiel schemes Proceedings of the 7th ACM conference on Computer and Communications Security, (125-133)
- Juels A and Peinado M (2000). Hiding Cliques for Cryptographic Security, Designs, Codes and Cryptography, 20:3, (269-280), Online publication date: 1-Jul-2000.
- Dumais P, Mayers D and Salvail L Perfectly concealing quantum bit commitment from any quantum one-way permutation Proceedings of the 19th international conference on Theory and application of cryptographic techniques, (300-315)
- Shoup V Using hash functions as a hedge against chosen ciphertext attack Proceedings of the 19th international conference on Theory and application of cryptographic techniques, (275-288)
- Katz J and Yung M Complete characterization of security notions for probabilistic private-key encryption Proceedings of the thirty-second annual ACM symposium on Theory of computing, (245-254)
- Naor M, Reingold O and Rosen A Pseudo-random functions and factoring (extended abstract) Proceedings of the thirty-second annual ACM symposium on Theory of computing, (11-20)
- Naor M, Pinkas B and Sumner R Privacy preserving auctions and mechanism design Proceedings of the 1st ACM conference on Electronic commerce, (129-139)
- Boyarsky M Public-key cryptography and password protocols Proceedings of the 6th ACM conference on Computer and communications security, (63-72)
- Naor M, Pinkas B and Reingold O Distributed Pseudo-random functions and KDCs Proceedings of the 17th international conference on Theory and application of cryptographic techniques, (327-346)
- Naor M and Pinkas B Oblivious transfer and polynomial evaluation Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (245-254)
- Di Crescenzo G and Impagliazzo R Security-preserving hardness-amplification for any regular one-way function Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (169-178)
- Beimel A, Ishai Y, Kushilevitz E and Malkin T One-way functions are essential for single-server private information retrieval Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (89-98)
- Blaze M, Feigenbaum J and Naor M A formal treatment of remotely keyed encryption Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (868-869)
- Lincoln P, Mitchell J, Mitchell M and Scedrov A A probabilistic poly-time framework for protocol analysis Proceedings of the 5th ACM conference on Computer and communications security, (112-121)
- Jakobsson M, Shriver E, Hillyer B and Juels A A practical secure physical random bit generator Proceedings of the 5th ACM conference on Computer and communications security, (103-111)
- Wool A Key management for encrypted broadcast Proceedings of the 5th ACM conference on Computer and communications security, (7-16)
- Naor M and Wool A (1998). Access Control and Signatures via Quorum Secret Sharing, IEEE Transactions on Parallel and Distributed Systems, 9:9, (909-922), Online publication date: 1-Sep-1998.
- Naor M, Ostrovsky R, Venkatesan R and Yung M (1998). Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation, Journal of Cryptology, 11:2, (87-108), Online publication date: 1-Mar-1998.
- Juels A and Peinado M Hiding cliques for cryptographic security Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (678-684)
- Cachin C Smooth entropy and Rényi entropy Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques, (193-208)
- Naor M and Reingold O On the construction of pseudo-random permutations Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, (189-199)
- Naor M and Wool A Access control and signatures via quorum secret sharing Proceedings of the 3rd ACM conference on Computer and communications security, (157-168)
- Kharitonov M (1995). Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution, Journal of Computer and System Sciences, 50:3, (600-610), Online publication date: 1-Jun-1995.
- De Santis A, Desmedt Y, Frankel Y and Yung M How to share a function securely Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (522-533)
- Kharitonov M Cryptographic hardness of distribution-specific learning Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (372-381)
- Döttling N and Schröder D Efficient Pseudorandom Functions via On-the-Fly Adaptation Advances in Cryptology -- CRYPTO 2015, (329-350)
Index Terms
- Pseudorandomness and Cryptographic Applications
Index terms have been assigned to the content through auto-classification.
Recommendations
Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness
Affine message authentication code (MAC) and delegatable affine MAC turn out to be useful tools for constructing identity-based encryption (IBE) and hierarchical IBE (HIBE), as shown in Blazy, Kiltz and Pan's (BKP) creative work in CRYPTO (2014). An ...
Cryptographic tamper evidence
CCS '03: Proceedings of the 10th ACM conference on Computer and communications securityWe propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div can determine whether one of them was generated by the forger. ...