Tightness of the Security Bound of CENC

Iwata, Tetsu

doi:10.4230/DagSemProc.07021.10

Document

Tightness of the Security Bound of CENC

Author Tetsu Iwata

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 7021
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2007-06-06

PDF

File

PDF

DagSemProc.07021.10.pdf

Filesize: 143 kB
6 pages

Document Identifiers

DOI: 10.4230/DagSemProc.07021.10
URN: urn:nbn:de:0030-drops-10169

Subject Classification

Keywords

Encryption mode
blockcipher
CENC
provable security

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

This talk presents an overview of recently developed 
encryption mode for blockciphers, called CENC.
CENC has the following advantages: 
(1) beyond the birthday bound security, 
(2) security proofs with the standard PRP assumption, 
(3) highly efficient, 
(4) single blockcipher key, 
(5) fully parallelizable, 
(6) allows precomputation of keystream, and 
(7) allows random access.
Then we discuss the tightness of its security bound, 
and give a partial answer to the open problem posed 
at FSE 2006.

Cite As Get BibTex

Tetsu Iwata. Tightness of the Security Bound of CENC. In Symmetric Cryptography. Dagstuhl Seminar Proceedings, Volume 7021, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007) https://doi.org/10.4230/DagSemProc.07021.10

Author Details

Tetsu Iwata

Any Issues?

Feedback on the Current Page

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail