January 5 – 10 , 2014, Dagstuhl Seminar 14021
1 / 2 >
For support, please contact
Symmetric cryptography deals with the case that both the sender and the receiver of a message are using the same key - the setting for symmetric encryption or authentication - as well as the case where there is no key at all - the setting for cryptographic hash functions. This differentiates symmetric cryptography from it asymmetric counterpart, where senders or verifiers use a "public key" and receivers or signers use a corresponding but different "private key." Although asymmetric cryptographic schemes provide in principle more flexibility, but are normally by orders of magnitude less efficient than symmetric cryptographic schemes. Thus, symmetric cryptosystems are the main workhorses of cryptography and highly relevant not only for academia, but also for industrial research, too.
The seminar was the fourth of its kind, the first one took place in 2007, the second in 2009, and the third in 2012. It concentrates on the design and analysis of
- symmetric primitives (block and stream ciphers, message authentication codes and hash functions), as well as
- complex cryptosystems and cryptographic protocols based on symmetric primitives.
One major topic was authenticated encryption. As already discussed at January 2012 Dagstuhl Seminar on Symmetric Cryptography, there is a demand for encryption schemes that ensure the confidentiality and integrity of data. This eventually led to an open cryptographic competition named CAESAR (Competition for Authenticated Encryption: Security, Applicability, and Robustness). The goal of CAESAR is to identify a portfolio of authenticated ciphers that offer advantages over standard approaches like AES-GCM and (2) are suitable for widespread adoption. To this end cryptographic algorithm designers are invited to submit proposals of authenticated ciphers to CAESAR. All proposals will be made public for evaluation. As the deadline for first round submissions was in March 2014, i.e., only several weeks after the seminar, several groups were actively working on designing and analyzing new proposals for authenticated encryption schemes. Moreover, there was a discussion session that was mainly devoted to current CAESAR submissions. One result was a better understanding of necessary requirements and the current state of these schemes.
Another major topic was the analyis of Even-Mansour encryption schemes. Such schemes generalize common design approaches by reducing these to the composition of simple, idealized components like random permutations. Other topics focused during the discussion session include random number generation and provable security complex cryptosystems.
Creative Commons BY 3.0 Unported license
Frederik Armknecht and Helena Handschuh and Tetsu Iwata and Bart Preneel
Dagstuhl Seminar Series
- 18021: "Symmetric Cryptography" (2018)
- 16021: "Symmetric Cryptography" (2016)
- 12031: "Symmetric Cryptography" (2012)
- 09031: "Symmetric Cryptography" (2009)
- 07021: "Symmetric Cryptography " (2007)
- Security / Cryptology
- Hash Functions
- Block Ciphers
- Provable Security