scientific article; zbMATH DE number 3960854

zbMATH Open0596.65002MaRDI QIDQ3729902FDOQ3729902

Authors: Oded Goldreich, Silvio Micali, Shafi Goldwasser 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• A Pseudorandom Generator from any One-way Function
• Hardness vs randomness
• One way functions and pseudorandom generators
• Publication:3471244
• On the Existence of Pseudorandom Generators

zbMATH Keywords

computational complexityrandom functionspolynomial-time algorithmrandomnessone-way functionsprediction problemspseudo random number generation

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (only showing first 100 items - show all)

• Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
• On related-secret pseudorandomness
• Matrix PRFs: constructions, attacks, and applications to obfuscation
• On the security of the WOTS-PRF signature scheme
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• The learnability of quantum states
• Computational Security of Quantum Encryption
• A simple construction of iO for Turing machines
• FE and iO for Turing machines from minimal assumptions
• Exploring crypto dark matter: new simple PRF candidates and their applications
• Watermarking PRFs under standard assumptions: public marking and security with extraction queries
• A study of password security
• Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
• A construction of the simplest super pseudorandom permutation generator
• Key-homomorphic pseudorandom functions from LWE with small modulus
• Output-compressing randomized encodings and applications
• Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
• Limits on the power of indistinguishability obfuscation and functional encryption
• Fast pseudorandom functions based on expander graphs
• Single-key to multi-key functional encryption with polynomial loss
• Constraining pseudorandom functions privately
• From Minicrypt to Obfustopia via private-key functional encryption
• Breaking the sub-exponential barrier in obfustopia
• Private puncturable PRFs from standard lattice assumptions
• Luby-Rackoff Ciphers from Weak Round Functions?
• Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
• Revocable hierarchical identity-based encryption with adaptive security
• Cryptography and cryptographic protocols
• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
• On symmetric encryption with distinguishable decryption failures
• On the correlation intractability of obfuscated pseudorandom functions
• On nonadaptive reductions to the set of random strings and its dense subsets
• Mathematical problems in cryptology
• On the complexity of compressing obfuscation
• Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
• Adaptive hardness and composable security in the plain model from standard assumptions
• Reducing complexity assumptions for statistically-hiding commitment
• Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
• Fine-Grained Cryptography
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
• On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems
• A randomness test for block ciphers
• Revocable hierarchical identity-based encryption with shorter private keys and update keys
• Collision-resistant and pseudorandom function based on Merkle-Damgård hash function
• A one-time stegosystem and applications to efficient covert communication
• Hardness-preserving reductions via cuckoo hashing
• A Proof of Security in O(2 n ) for the Benes Scheme
• Short Redactable Signatures Using Random Trees
• Universal forecasting algorithms
• Order-Preserving Symmetric Encryption
• Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
• Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
• Tree-based cryptographic access control
• The Complexity of Public-Key Cryptography
• Efficient authentication from hard learning problems
• Keymill: side-channel resilient key generator, a new concept for SCA-security by design
• Shared generation of pseudo-random functions
• Evolving homomorphic secret sharing for hierarchical access structures
• Functional encryption for Turing machines with dynamic bounded collusion from LWE
• A new framework for deniable secure key exchange
• Sparse pseudorandom distributions
• Non-interactive secure computation from one-way functions
• Simple and more efficient PRFs with tight security from LWE and matrix-DDH
• Pseudorandom sources for BPP
• Monkey: black-box symmetric ciphers designed for MON\textit{opolizing} KEY\textit{s}
• Leakage resilience from program obfuscation
• On the universal steganography of optimal rate
• The Layered Games Framework for Specifications and Analysis of Security Protocols
• Block encryption of quantum messages
• Hidden cosets and applications to unclonable cryptography
• Computing on authenticated data
• From non-adaptive to adaptive pseudorandom functions
• Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
• MoSS: modular security specifications framework
• Watermarking cryptographic functionalities from standard lattice assumptions
• Watermarking cryptographic capabilities
• Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
• The round complexity of quantum zero-knowledge
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Targeted lossy functions and applications
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Efficient noise generation to achieve differential privacy with applications to secure multiparty computation
• Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
• Composition Implies Adaptive Security in Minicrypt
• CCA secure \textit{a posteriori} openable encryption in the standard model
• Simpler constructions of asymmetric primitives from obfuscation
• How should we solve search problems privately?
• Bounds on the efficiency of black-box commitment schemes
• On security preserving reductions -- revised terminology
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
• Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
• Unknown-input attacks in the parallel setting: improving the security of the CHES 2012 leakage-resilient PRF
• On statistically secure obfuscation with approximate correctness
• A Noiseless Key-Homomorphic PRF: Application on Distributed Storage Systems
• Batch-OT with optimal rate
• Distributed (correlation) samplers: how to remove a trusted dealer in one round
• Lightweight, maliciously secure verifiable function secret sharing
• Incompressible cryptography
• On efficient leakage-resilient pseudorandom functions with hard-to-invert leakages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3729902)