Towards realizing random oracles: hash functions that hide all partial information
From MaRDI portal
Recommendations
Cited in
(68)- Entropic security in quantum cryptography
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Another step towards realizing random oracles: non-malleable point obfuscation
- On virtual grey box obfuscation for general circuits
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- The hunting of the SNARK
- Correcting subverted random oracles
- Leakage resilient one-way functions: the auxiliary-input setting
- Reusable fuzzy extractors for low-entropy distributions
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- On selective-opening security of deterministic primitives
- Witness authenticating NIZKs and applications
- Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications
- Obfuscation for cryptographic purposes
- The magic of ELFs
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Sound and complete computational interpretation of symbolic hashes in the standard model
- Impossibility of VBB obfuscation with ideal constant-degree graded encodings
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
- On the correlation intractability of obfuscated pseudorandom functions
- Cryptographic assumptions: a position paper
- Contention in cryptoland: obfuscation, leakage and UCE
- Point-function obfuscation: a framework and generic constructions
- Signatures Resilient to Uninvertible Leakage
- Shorter circuit obfuscation in challenging security models
- Obfuscation combiners
- The Magic of ELFs
- Computational soundness of symbolic analysis for protocols using hash functions
- A note on obfuscation for cryptographic functionalities of secret-operation then public-encryption
- Random oracles with(out) programmability
- Expedient Non-malleability Notions for Hash Functions
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
- Limits on the power of indistinguishability obfuscation and functional encryption
- Leakage Resilient One-Way Functions: The Auxiliary-Input Setting
- Towards forward security properties for PEKS and IBE
- scientific article; zbMATH DE number 4213418 (Why is no real title available?)
- On symmetric encryption and point obfuscation
- Obfuscation of hyperplane membership
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Modeling random oracles under unpredictable queries
- On pseudo-random oracles
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Toward RSA-OAEP without random oracles
- scientific article; zbMATH DE number 7286918 (Why is no real title available?)
- Obfuscating conjunctions
- Replacing a random oracle: full domain hash from indistinguishability obfuscation
- Leaky Random Oracle (Extended Abstract)
- Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes
- On the statistical properties of Diffie-Hellman distributions
- A random oracle for all of us
- How to obfuscate MPC inputs
- CHIP and CRISP: protecting all parties against compromise through identity-binding PAKEs
- Augmented random oracles
- Lockable obfuscation from circularly insecure fully homomorphic encryption
- Beyond Uber: instantiating generic groups via PGGs
- Instantiability of classical random-oracle-model encryption transforms
- Nonmalleable digital lockers and robust fuzzy extractors in the plain model
- Small Superset and Big Subset Obfuscation
- Securely obfuscating re-encryption
- Obfuscating evasive decision trees
- A public key identity-based revocation scheme: fully attribute-hiding and function private
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
- Obfuscation of evasive algebraic set membership
- On best-possible obfuscation
- Better security for deterministic public-key encryption: the auxiliary-input setting
- On strong simulation and composable point obfuscation
This page was built for publication: Towards realizing random oracles: hash functions that hide all partial information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364570)
