Theory of Cryptography
From MaRDI portal
Publication:5898355
DOI10.1007/11681878zbMath1112.94009OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898355
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
Related Items (11)
How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ Towards Understanding the Known-Key Security of Block Ciphers ⋮ Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model ⋮ A short non-delegatable strong designated verifier signature ⋮ On the cryptanalysis of the hash function Fugue: partitioning and inside-out distinguishers ⋮ Probably Secure Keyed-Function Based Authenticated Encryption Schemes for Big Data ⋮ How to Build a Hash Function from Any Collision-Resistant Function ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Verifiable Random Functions from Identity-Based Key Encapsulation ⋮ Indifferentiability of 8-Round Feistel Networks ⋮ A Domain Extender for the Ideal Cipher
This page was built for publication: Theory of Cryptography
