Augmented random oracles

DOI10.1007/978-3-031-15982-4_2MaRDI QIDQ6163941zbMATH OpenFDO

Authors Mark Zhandry

Publication date 30 June 2023

Published in Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-15982-4_2

zbMATH Keywords

augmented random oracle modelsecurity of random oracle-based protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Random Oracles and Auxiliary Input
• scientific article; zbMATH DE number 1775406
• scientific article; zbMATH DE number 177821
• On pseudo-random oracles
• Random oracles and non-uniformity
• Deterministic random oracles
• On independent random oracles
• Random Oracle Reducibility
• Random oracles with(out) programmability
• On the random oracle hypothesis

Cites work

• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology – CRYPTO 2004
• An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
• Another step towards realizing random oracles: non-malleable point obfuscation
• Barriers in cryptography with weak, correlated and leaky sources
• Better security for deterministic public-key encryption: the auxiliary-input setting
• Contention in cryptoland: obfuscation, leakage and UCE
• Correlated-input secure hash functions
• Deterministic and Efficiently Searchable Encryption
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1303133 (Why is no real title available?)
• scientific article; zbMATH DE number 1088253 (Why is no real title available?)
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• scientific article; zbMATH DE number 1951605 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• Indifferentiability for public key cryptosystems
• Instantiating random oracles via UCEs
• Limits on the power of indistinguishability obfuscation and functional encryption
• Lower bounds for non-black-box zero knowledge
• Merkle-Damgård Revisited: How to Construct a Hash Function
• On perfect correctness in (lockable) obfuscation
• On the correlation intractability of obfuscated pseudorandom functions
• On the Generic Insecurity of the Full Domain Hash
• On virtual grey box obfuscation for general circuits
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Random oracles with(out) programmability
• Random-oracle uninstantiability from indistinguishability obfuscation
• Replacing a random oracle: full domain hash from indistinguishability obfuscation
• Secure integration of asymmetric and symmetric encryption schemes
• Separating succinct non-interactive arguments from all falsifiable assumptions
• The distinction between fixed and random generators in group-based assumptions
• The Magic of ELFs
• The random oracle model: a twenty-year retrospective
• Theory of Cryptography
• Why ``Fiat-Shamir for proofs lacks a proof

Cited in

(5)

• Random Oracles and Auxiliary Input
• Random-oracle uninstantiability from indistinguishability obfuscation
• Proof-carrying data from arithmetized random oracles
• Non-Observable Quantum Random Oracle Model
• On the black-box complexity of private-key inner-product functional encryption

This page was built for publication: Augmented random oracles

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