Theory of Cryptography

DOI10.1007/11681878zbMATH Open1112.94009OpenAlexW3149533473MaRDI QIDQ5898355FDOQ5898355

Authors: Yevgeniy Dodis, Prashant Puniya 

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11681878

Recommendations

• The equivalence of the random oracle model and the ideal cipher model, revisited
• The Random Oracle Model and the Ideal Cipher Model Are Equivalent
• On cipher-dependent related-key attacks in the ideal-cipher model
• Random oracle model and analysis of primitives of a cryptographic scheme
• Instantiability of classical random-oracle-model encryption transforms
• Security of Encryption Schemes in Weakened Random Oracle Models
• Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• The security of multiple encryption in the ideal cipher model
• Advances in Cryptology - EUROCRYPT 2004

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (19)

• Verifiable Random Functions from Identity-Based Key Encapsulation
• How to build an ideal cipher: the indifferentiability of the Feistel construction
• The equivalence of the random oracle model and the ideal cipher model, revisited
• Towards Understanding the Known-Key Security of Block Ciphers
• The relationship between idealized models under computationally bounded adversaries
• Indifferentiability of 8-Round Feistel Networks
• Randomized half-ideal cipher on groups with applications to UC (a)PAKE
• Instantiability of classical random-oracle-model encryption transforms
• Verifiable random functions: relations to identity-based key encapsulation and new constructions
• Probably secure keyed-function based authenticated encryption schemes for big data
• A short non-delegatable strong designated verifier signature
• Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model
• Reset indifferentiability and its consequences
• A unified approach to idealized model separations via indistinguishability obfuscation
• On the cryptanalysis of the hash function Fugue: partitioning and inside-out distinguishers
• A domain extender for the ideal cipher
• How to Build a Hash Function from Any Collision-Resistant Function
• The Random Oracle Model and the Ideal Cipher Model Are Equivalent
• The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function

This page was built for publication: Theory of Cryptography

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