On the Round Security of Symmetric-Key Cryptographic Primitives

On the Round Security of Symmetric-Key Cryptographic Primitives (2000)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Zulfikar Ramzan , Leonid Reyzin

Venue:	In Advances in Cryptology — CRYPTO ’00, volume 1880 of LNCS
Citations:	8 - 1 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	On the Round Security of Symmetric-Key Cryptographic Primitives	INFERENCE
AUTHOR NAME	Zulfikar Ramzan	user correction - Legacy Corrections
AUTHOR ADDR	1.1 Block Ciphers	user correction - Legacy Corrections
AUTHOR NAME	Leonid Reyzin	user correction - Legacy Corrections
AUTHOR ADDR	1.1 Block Ciphers	user correction - Legacy Corrections
ABSTRACT	We put forward a new model for understanding the security of symmetric-key primitives, such as block ciphers. The model captures the fact that many such primitives often consist of iterating simpler constructs for a number of rounds, and may provide insight into the security of such designs. We completely characterize the security of four-round Luby-Racko ciphers in our model, and show that the ciphers remain secure even if the adversary is given black-box access to the middle two round functions. A similar result can be obtained for message authentication codes based on universal hash functions. 1 Introduction 1.1 Block Ciphers A block cipher is a family of permutations on a message space indexed by a secret key. Each permutation in the family deterministically maps plaintext blocks of some xed length to ciphertext blocks of the same length; both the permutation and its inverse are eciently computable given the key. Motivated originally by the study of security of the block ciphe...	user correction - Legacy Corrections
YEAR	2000	INFERENCE
VENUE	In Advances in Cryptology — CRYPTO ’00, volume 1880 of LNCS	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	376--393	INFERENCE
VOLUME	1880	INFERENCE
CITATIONS	22 found	ParsCit 1.0