Synthesizers and their application to the parallel construction of pseudo-random functions

DOI10.1006/jcss.1998.1618zbMath0922.68052OpenAlexW1909955916MaRDI QIDQ1288205

Moni Naor, Omer Reingold

Publication date: 11 May 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1998.1618

zbMATH Keywords

identificationcomputational learning theoryauthenticationencryptionpseudo-random function

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (24)

Cryptography from Learning Parity with Noise ⋮ Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security ⋮ Performance improvement for the GGM-construction of pseudorandom functions ⋮ (Pseudo) random quantum states with binary phase ⋮ A pseudorandom number generator based on worst-case lattice problems ⋮ Bounded-collusion decentralized ABE with sublinear parameters ⋮ Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ On the uniformity of distribution of the RSA pairs ⋮ Lossy trapdoor functions from homomorphic reproducible encryption ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ Pseudorandom functions in NC class from the standard LWE assumption ⋮ The communication complexity of addition ⋮ Basing cryptographic protocols on tamper-evident seals ⋮ Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Cryptography in the multi-string model ⋮ Cryptography with constant input locality ⋮ From non-adaptive to adaptive pseudorandom functions ⋮ Pseudorandom Functions: Three Decades Later ⋮ On the distribution of the Diffie-Hellman pairs ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Checking the correctness of memories
• Probabilistic encryption
• Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
• Artin's conjecture for primitive roots
• A key distribution system equivalent to factoring
• Modern cryptology. A tutorial
• Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
• Pseudorandom generators for space-bounded computation
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• The discrete logarithm modulo a composite hides \(O(n)\) bits
• Hardness vs randomness
• Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
• When won't membership queries help?
• Randomness is linear in space
• Stronger security proofs for RSA and Rabin bits.
• Efficient cryptographic schemes provably as secure as subset sum
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• Constant depth circuits, Fourier transform, and learnability
• Number-theoretic constructions of efficient pseudo-random functions
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Algorithms for Black-Box Fields and their Application to Cryptography
• A theory of the learnable
• A Simple Unpredictable Pseudo-Random Number Generator
• Log Depth Circuits for Division and Related Problems
• How to Generate Factored Random Numbers
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Efficient Parallel Pseudorandom Number Generation
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S.
• Cryptographic limitations on learning Boolean formulae and finite automata
• Cryptographic hardness of distribution-specific learning
• Natural proofs

This page was built for publication: Synthesizers and their application to the parallel construction of pseudo-random functions