Advances in Cryptology – CRYPTO 2004

DOI10.1007/b99099zbMath1104.68470OpenAlexW2477011922WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311553

Rosario Gennaro, Tal Rabin, Hugo Krawczyk, Yevgeniy Dodis, Johan T. Håstad

Publication date: 23 August 2005

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

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

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62)

Related Items (15)

Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Condensed Unpredictability ⋮ Revisiting structure graphs: applications to CBC-MAC and EMAC ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ New proofs for NMAC and HMAC: security without collision resistance ⋮ Subvert KEM to break DEM: practical algorithm-substitution attacks on public-key encryption ⋮ Subliminal Hash Channels ⋮ On Randomness Extraction in Elliptic Curves ⋮ Malleability of the blockchain's entropy ⋮ Efficient one-sided adaptively secure computation ⋮ Two-Source Randomness Extractors for Elliptic Curves for Authenticated Key Exchange ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ A New Mode of Operation for Block Ciphers and Length-Preserving MACs ⋮ Efficient Fully-Simulatable Oblivious Transfer ⋮ Security analysis of NIST CTR-DRBG

This page was built for publication: Advances in Cryptology – CRYPTO 2004