Modeling random oracles under unpredictable queries

DOI10.1007/978-3-662-52993-5_23MaRDI QIDQ4639493zbMATH OpenOpenAlexFDO

Authors Pooya Farshim, Arno Mittelbach

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

indifferentiabilityKDM securitymulti-stage securityrandom oracleRKA securityUCEunpredictabilityZipper Hash

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Instantiating random oracles via UCEs
• Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources
• Chosen ciphertext security via UCE
• A random oracle for all of us
• Using indistinguishability obfuscation via UCEs

Cites work

• A formal treatment of backdoored pseudorandom generators
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Careful with composition: limitations of the indifferentiability framework
• Chosen ciphertext security via UCE
• Constructing an Ideal Hash Function from Weak Ideal Compression Functions
• Contention in cryptoland: obfuscation, leakage and UCE
• Correlated-input secure hash functions
• Cryptography from compression functions: the UCE bridge to the ROM
• Extractable Perfectly One-Way Functions
• Foundations of non-malleable hash and one-way functions
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 1088253 (Why is no real title available?)
• scientific article; zbMATH DE number 1942411 (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 2009976 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources
• Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
• Instantiating random oracles via UCEs
• Interactive Message-Locked Encryption and Secure Deduplication
• Keying hash functions for message authentication
• Merkle-Damgård Revisited: How to Construct a Hash Function
• One Way Hash Functions and DES
• Pseudorandom functions and permutations provably secure against related-key attacks
• Related-Key Cryptanalysis of the Full AES-192 and AES-256
• Resisting randomness subversion: fast deterministic and hedged public-key encryption in the standard model
• Salvaging indifferentiability in a multi-stage setting
• Tamper and Leakage Resilience in the Split-State Model
• Theory of Cryptography
• Towards a Theory of Extractable Functions
• Using indistinguishability obfuscation via UCEs

Cited in

(6)

• 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
• Using indistinguishability obfuscation via UCEs
• Chosen ciphertext security via UCE
• The random oracle model: a twenty-year retrospective

This page was built for publication: Modeling random oracles under unpredictable queries

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