The random oracle methodology, revisited.
From MaRDI portal
Publication:3069902
Recommendations
Cited in
(only showing first 100 items - show all)- Random oracles and non-uniformity
- Efficient public key encryption with equality test in the standard model
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Instantiation of quantum point obfuscation
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Weak-key distinguishers for AES
- How to Generate and Use Universal Samplers
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- Random oracles with(out) programmability
- Fiat-Shamir security of FRI and related SNARKs
- Deterministic random oracles
- Certificateless strong key-insulated signature without random oracles
- Salvaging Merkle-Damgård for Practical Applications
- A practical protocol for three-party authenticated quantum key distribution
- Another step towards realizing random oracles: non-malleable point obfuscation
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- A new provably secure certificateless signature with revocation in the standard model
- A pairing-based publicly verifiable secret sharing scheme
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- Confidential and efficient asset proof for bitcoin exchanges
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- Post-quantum anonymous one-sided authenticated key exchange without random oracles
- Theory of Cryptography
- A random oracle for all of us
- Second order collision for the 42-step reduced DHA-256 hash function
- Certificateless signature scheme with security enhanced in the standard model
- Hash functions from defective ideal ciphers
- Compact accountable ring signatures in the plain 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 transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- An improved efficient identity-based proxy signature in the standard model
- A strong designated verifier proxy re-signature scheme for IoT environments
- Impossibility of simulation secure functional encryption even with random oracles
- Impact of randomization in VKO mechanisms on overall security level
- Secure ElGamal-type cryptosystems without message encoding
- Limits on the usefulness of random oracles
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- 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
- An epistemic foundation for authentication logics (extended abstract)
- Theory of Cryptography
- Implicit zero-knowledge arguments and applications to the malicious setting
- Fast, compact, and expressive attribute-based encryption
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fast, compact, and expressive attribute-based encryption
- Cryptographic assumptions: a position paper
- Cryptography and algorithmic randomness
- Linkable ring signature scheme with stronger security guarantees
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Efficient identity-based signcryption in the standard model
- The Complexity of Zero Knowledge
- Nonmalleable digital lockers and robust fuzzy extractors in the plain model
- Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour
- An ElGamal-like secure channel free public key encryption with keyword search scheme
- On the implementation of huge random objects
- Beyond Uber: instantiating generic groups via PGGs
- A formal security analysis of the Signal messaging protocol
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- Secure and efficient identity-based proxy signature scheme in the standard model based on computational Diffie-Hellman problem
- On the correlation intractability of obfuscated pseudorandom functions
- Provably-secure remote memory attestation for heap overflow protection
- Non-interactive batch arguments for NP from standard assumptions
- Efficient Non-interactive Range Proof
- Security proofs for signature schemes
- Round-optimal black-box protocol compilers
- Known-Key Distinguishers for Some Block Ciphers
- Exploring confusion in product ciphers through regression analysis
- 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
- Garbling XOR gates ``for free in the standard model
- The wonderful world of global random oracles
- Leaky Random Oracle (Extended Abstract)
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
- Identity-based partially blind signature in the standard model for electronic cash
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure 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
- Efficient Traceable Signatures in the Standard Model
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Interactive oracle proofs
- Instantiability of classical random-oracle-model encryption transforms
- Correcting subverted random oracles
- HIERARCHICAL IDENTITY-BASED PROXY RE-ENCRYPTION WITHOUT RANDOM ORACLES
- On the indifferentiability of Fugue and Luffa
- Secure authenticated comparisons
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
- 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)
- Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
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)
