Modeling Random Oracles Under Unpredictable Queries

DOI10.1007/978-3-662-52993-5_23zbMath1387.94080OpenAlexW2485231290MaRDI QIDQ4639493

Arno Mittelbach, Pooya Farshim

Publication date: 9 May 2018

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://hal-ens.archives-ouvertes.fr/hal-01470886/file/main.pdf

zbMATH Keywords

indifferentiabilityrandom oracleunpredictabilityKDM securityRKA securitymulti-stage securityUCEZipper Hash

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-malleable coding against bit-wise and split-state tampering
• Contention in Cryptoland: Obfuscation, Leakage and UCE
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Instantiating Random Oracles via UCEs
• Cryptography from Compression Functions: The UCE Bridge to the ROM
• Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources
• Tamper and Leakage Resilience in the Split-State Model
• Using Indistinguishability Obfuscation via UCEs
• Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
• Interactive Message-Locked Encryption and Secure Deduplication
• A Formal Treatment of Backdoored Pseudorandom Generators
• Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
• Correlated-Input Secure Hash Functions
• Careful with Composition: Limitations of the Indifferentiability Framework
• Keying Hash Functions for Message Authentication
• Extractable Perfectly One-Way Functions
• Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
• Towards a Theory of Extractable Functions
• Related-Key Cryptanalysis of the Full AES-192 and AES-256
• Foundations of Non-malleable Hash and One-Way Functions
• Chosen Ciphertext Security via UCE
• Salvaging Indifferentiability in a Multi-stage Setting
• Constructing an Ideal Hash Function from Weak Ideal Compression Functions
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Theory of Cryptography
• One Way Hash Functions and DES

This page was built for publication: Modeling Random Oracles Under Unpredictable Queries