The random oracle methodology, revisited.
From MaRDI portal
Publication:3069902
DOI10.1145/1008731.1008734zbMATH Open1204.94063OpenAlexW2152688060MaRDI QIDQ3069902FDOQ3069902
Authors: Ran Canetti, Oded Goldreich, Shai Halevi 
Publication date: 1 February 2011
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/2144/39024
Recommendations
Cited In (only showing first 100 items - show all)
- Efficient public key encryption with equality test in the standard model
- How to Generate and Use Universal Samplers
- Instantiation of quantum point obfuscation
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Second order collision for the 42-step reduced DHA-256 hash function
- Certificateless signature scheme with security enhanced in the standard model
- Public key encryption with equality test from generic assumptions in the random oracle model
- Toward non-interactive zero-knowledge proofs for NP from LWE
- A strong designated verifier proxy re-signature scheme for IoT environments
- Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Implicit zero-knowledge arguments and applications to the malicious setting
- Cryptographic assumptions: a position paper
- Cryptography and algorithmic randomness
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- On the correlation intractability of obfuscated pseudorandom functions
- Secure and efficient identity-based proxy signature scheme in the standard model based on computational Diffie-Hellman problem
- Non-interactive batch arguments for NP from standard assumptions
- The wonderful world of global random oracles
- Instantiability of classical random-oracle-model encryption transforms
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Interactive oracle proofs
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- Correcting subverted random oracles
- Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
- Traceable ring signatures: general framework and post-quantum security
- The theory of hash functions and random oracles. An approach to modern cryptography
- Instantiability of RSA-OAEP under chosen-plaintext attack
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- SNARGs for P from sub-exponential DDH and QR
- Certificateless two-party authenticated key agreement scheme for smart grid
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Non-interactive zero knowledge from sub-exponential DDH
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- Non-interactive composition of sigma-protocols via Share-then-Hash
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Multi-theorem designated-verifier NIZK for QMA
- TARD: temporary access rights delegation for guest network devices
- Cryptographic pseudorandom generators can make cryptosystems problematic
- Toward RSA-OAEP without random oracles
- Abstractions of non-interference security: probabilistic versus possibilistic
- Secure identity-based signcryption in the standard model
- A lattice-based signcryption scheme without random oracles
- Practical chosen ciphertext secure encryption from factoring
- Secure independent-update concise-expression access control for video on demand in cloud
- Multikey fully homomorphic encryption and applications
- Naor-Yung paradigm with shared randomness and applications
- A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model
- Secure MPC: laziness leads to GOD
- How to simulate it -- a tutorial on the simulation proof technique
- How Risky Is the Random-Oracle Model?
- Notes on a provably-secure certificate-based encryption against malicious CA attacks
- Identity-based aggregate signcryption in the standard model from multilinear maps
- Indifferentiability for public key cryptosystems
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- Fiat-Shamir security of FRI and related SNARKs
- Post-quantum anonymous one-sided authenticated key exchange without random oracles
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- Compact accountable ring signatures in the plain model
- Hash functions from defective ideal ciphers
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- An improved efficient identity-based proxy signature in the standard model
- Impact of randomization in VKO mechanisms on overall security level
- Secure ElGamal-type cryptosystems without message encoding
- An epistemic foundation for authentication logics (extended abstract)
- Linkable ring signature scheme with stronger security guarantees
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Nonmalleable digital lockers and robust fuzzy extractors in the plain model
- The Complexity of Zero Knowledge
- Efficient identity-based signcryption in the standard model
- An ElGamal-like secure channel free public key encryption with keyword search scheme
- Beyond Uber: instantiating generic groups via PGGs
- Provably-secure remote memory attestation for heap overflow protection
- A new framework for quantum oblivious transfer
- Indifferentiability of the confusion-diffusion network and the cascade block cipher
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
- HIERARCHICAL IDENTITY-BASED PROXY RE-ENCRYPTION WITHOUT RANDOM ORACLES
- On the indifferentiability of Fugue and Luffa
- Secure authenticated comparisons
- Correlation intractability and SNARGs from sub-exponential DDH
- On the impossibility of algebraic NIZK in pairing-free groups
- Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
- Perfect nonlinear S-boxes on the real-line
- Efficient leakage-resilient MACs without idealized assumptions
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
- Foundations of adaptor signatures
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- A Note on the Instantiability of the Quantum Random Oracle
- Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols
- Generic construction of certificate-based signature from certificateless signature with provable security
- The GGM Function Family Is a Weakly One-Way Family of Functions
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
- Non-interactive zero-knowledge from LPN and MQ
- Quantum advantage from one-way functions
- Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
- Obfuscation of pseudo-deterministic quantum circuits
- Quantum depth in the random oracle model
This page was built for publication: The random oracle methodology, revisited.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069902)
