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)
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Random oracles and non-uniformity
- Random oracles with(out) programmability
- Weak-key distinguishers for AES
- Deterministic random oracles
- Salvaging Merkle-Damgård for Practical Applications
- Certificateless strong key-insulated signature without random oracles
- A practical protocol for three-party authenticated quantum key distribution
- Another step towards realizing random oracles: non-malleable point obfuscation
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- A random oracle for all of us
- Theory of Cryptography
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- A pairing-based publicly verifiable secret sharing scheme
- Confidential and efficient asset proof for bitcoin exchanges
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Title not available (Why is that?)
- Impossibility of simulation secure functional encryption even with random oracles
- Theory of Cryptography
- Fast, compact, and expressive attribute-based encryption
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- On the implementation of huge random objects
- Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- A formal security analysis of the Signal messaging protocol
- Efficient Non-interactive Range Proof
- Known-Key Distinguishers for Some Block Ciphers
- Round-optimal black-box protocol compilers
- Leaky Random Oracle (Extended Abstract)
- Exploring confusion in product ciphers through regression analysis
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
- Garbling XOR gates ``for free in the standard model
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
- Identity-based partially blind signature in the standard model for electronic cash
- Efficient Traceable Signatures in the Standard Model
- The random oracle model: a twenty-year retrospective
- Strong key-insulated signature in the standard model
- On best-possible obfuscation
- Certificateless signcryption scheme in the standard model
- Cryptographic Assumptions: A Position Paper
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
- Adaptively secure non-interactive threshold cryptosystems
- Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Sound and complete computational interpretation of symbolic hashes in the standard model
- A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack
- A Public-Key Encryption Scheme with Pseudo-random Ciphertexts
- On the Correlation Intractability of Obfuscated Pseudorandom Functions
- Provable security against generic attacks on stream ciphers
- Efficient traceable signatures in the standard model
- Automated Reasoning
- Distinguishers for Ciphers and Known Key Attack against Rijndael with Large Blocks
- Random oracle model and analysis of primitives of a cryptographic scheme
- Efficiency limitations for \(\Sigma \)-protocols for group homomorphisms
- Title not available (Why is that?)
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- On cipher-dependent related-key attacks in the ideal-cipher model
- A new two-round certificateless authenticated key agreement protocol without bilinear pairings
- How to Build a Hash Function from Any Collision-Resistant Function
- Adaptive-ID Secure Revocable Identity-Based Encryption
- On pseudo-random oracles
- Fast, Compact, and Expressive Attribute-Based Encryption
- Cryptanalysis of a certificateless signcryption scheme in the standard model
- On the analysis of cryptographic assumptions in the generic ring model
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Two-server password-only authenticated key exchange
- Faster and Shorter Password-Authenticated Key Exchange
- An identity-based strongly unforgeable signature without random oracles from bilinear pairings
- Forward-secure identity-based encryption with direct chosen-ciphertext security in the standard model
- A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation
- Advances in Cryptology - EUROCRYPT 2004
- Certificateless key-insulated signature without random oracles
- Broadcast encryption based non-interactive key distribution in MANETs
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- 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
- Post-quantum anonymous one-sided authenticated key exchange without random oracles
- 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
- Toward RSA-OAEP Without Random Oracles
- Multikey Fully Homomorphic Encryption and Applications
- 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
- Cryptography and algorithmic randomness
- Efficient identity-based signcryption in the standard model
- 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
- How to Simulate It – A Tutorial on the Simulation Proof Technique
- Instantiability of classical random-oracle-model encryption transforms
- 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
- Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
- Traceable ring signatures: general framework and post-quantum security
- Instantiability of RSA-OAEP under chosen-plaintext attack
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)
