The 2nd Workshop on Real-Life Cryptographic Protocols and Standardization
As a fruit of modern cryptographic research, we have seen many cryptographic primitives such as public-key encryption and digital signature algorithms deployed in real life systems, and standardized in many international organizations such as ISO, ITUT, IEEE, IETF, and many others. We have also seen some cryptographic protocols as well, such as key distribution and entity authentication, and some dedicated protocols for limited purpose systems. This workshop aims to bring researchers and engineers together to share their experiences regarding the design of cryptographic primitives and protocols deployed in real life systems.
Real life poses us many limitations: not only software and hardware limitations, but limitations form operational requirements and development time requirements, needless to say cost perspectives. All these limitations lie in a trade-off fashion with many functional requirements and security requirements. Designing best suitable cryptographic protocols despite such limitations is not an easy task, and resulting scheme may not be published in current conferences due to the perceived lack of novelty of their core design components. The purpose of this workshop is to study the design criteria of real-life cryptographic protocols, how one prioritized the requirements and limitations, and how one modeled real life entities. This workshop also aims to stimulate discussions on standardizing cryptographic protocols to proliferate their use.
- Paper Submission: November 1, 2010, midnight PST
- Paper Notification: December 8, 2010
- Final Papers: January 21, 2011
Authors may only submit work that does not substantially overlap with work that is currently submitted or has been accepted for publication to a conference with proceedings or a journal. Papers must be formatted in standard PDF format, less than 15 pages long in LNCS style. Submissions are not required to be anonymized. All papers must be submitted electronically according to the instructions and forms found on this web site and at the easychair submission site.
Accepted papers will appear as a separate chapter in the FC proceedings (LNCS).
Previous workshop appeared in LNCS 6054.
PROGRAM for Friday March 4, 2011
9:00 - 10:00 Invited Talk: Moti Yung
10:00 - 10:30 Coffee Break
10:30 - 11:45 Session 1
- Ping Yu and Rui Xue:
"Toward Real-life Implementation of Signature Schemes from the Strong RSA Assumption"
- Masahiko Takenaka, Tetsuya Izu, Yumi Sakemi, Yoshitaka MORIKAWA and Yasuyuki NOGAMI:
"Detailed Cost Estimation of CNTW Attack against EMV Signature Scheme"
- Emilia Kasper:
"Fast Elliptic Curve Cryptography in OpenSSL"
11:45 - 13:00 Lunch
13:00 - 15:05 Session 2
- Felix Gunther, Mark Manulis and Thorsten Strufe:
"Cryptographic Treatment of Private User Profiles"
- Jennia Hizver and Tzi-cker Chiueh:
"An Introspection-Based Memory Scraper Attack against Virtualized Point of Sale Systems"
- Yoshikazu Hanatani, Miyako Ohkubo, Shin'ichiro Matsuo, Kazuo Sakiyama and Kazuo Ohta:
"A Study on Computational Formal Verification for Practical Cryptographic Protocol: The Case of Synchronous RFID Authentication"
- Daniel Hartung and Christoph Busch:
"Biometric Transaction Authentication Protocol: Formal Model Verification and 'Four-Eyes' Principle Extension"
- Kemal Bicakci, Nart Bedin Atalay, Mustafa Yuceel and Paul Van Oorschot:
"Exploration and Field Study of a Browser-based Password Manager using Icon-based Passwords"
15:05 - 15:30 Coffee Break
15:30 - 17:00 Work in Progress Session
- Josh Benaloh, Microsoft Research
- Aline Gouget, Gemalto and CryptoExperts
- Hongxia Jin, IBM Almaden
- Aggelos Kiayias, University of Connecticut
- Helger Lipmaa,Cybernetica AS and Tallinn University
- Sandra Marcello, Thales
- Jean-Francois Misarsky, Orange Labs
- David Naccache, ENS
- Kaisa Nyberg, Aalto University and Nokia
- Satoshi Obana, NEC
- Pascal Paillier, Gemalto and CryptoExperts
- Benny Pinkas, Bar Ilan University
- Ahmad-Reza Sadeghi, TU Darmstadt and Fraunhofer SIT
- Kazue Sako, NEC (chair)