On the Cryptographic Applications of Random Functions (Extended Abstract)

DOI10.1007/3-540-39568-7_22zbMath1359.94599OpenAlexW2125218823WikidataQ57407783 ScholiaQ57407783MaRDI QIDQ2974488

Oded Goldreich, Silvio Micali, Shafi Goldwasser

Publication date: 10 April 2017

Published in: Advances in Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-39568-7_22

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \), Witness Maps and Applications, Exploring crypto dark matter: new simple PRF candidates and their applications, Quantum algorithms for the \(k\)-XOR problem, MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications, The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC, Towards Non-Black-Box Separations of Public Key Encryption and One Way Function, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, Performance improvement for the GGM-construction of pseudorandom functions, Batch-OT with optimal rate, Authentication in the bounded storage model, Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions, Key regression from constrained pseudorandom functions, On-line ciphers and the Hash-CBC constructions, Error-Correcting Codes Against Chosen-Codeword Attacks, Secure two-party input-size reduction: challenges, solutions and applications, Hardness-preserving reductions via cuckoo hashing, One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions, The power of undirected rewindings for adaptive security, The cost of adaptivity in security games on graphs, Simple and more efficient PRFs with tight security from LWE and matrix-DDH, Unnamed Item, Bounds on the efficiency of black-box commitment schemes, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Attribute-based key-insulated signature and its applications, Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography, Tighter security proofs for GPV-IBE in the quantum random oracle model, Reducing complexity assumptions for statistically-hiding commitment, Adaptively Secure Garbled Circuits from One-Way Functions, Synthesizers and their application to the parallel construction of pseudo-random functions, Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments, Unnamed Item, Unnamed Item, From non-adaptive to adaptive pseudorandom functions, Pseudorandom Functions: Three Decades Later