Topics in Cryptology – CT-RSA 2006 The Cryptographers’ Track at the RSA Conference 2006, San Jose, CA, USA, February 13-17, 2005. Proceedings /
The RSA R Conference, with over 15,000attendees, as well as over 225 sponsors and exhibitors, is the largest computer security event of the year. The Cr- tographers’ Track is one of the many parallel tracks. These proceedings contain the papers presented during the sixth edition. The tradition indee...
Συγγραφή απο Οργανισμό/Αρχή: | |
---|---|
Άλλοι συγγραφείς: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2006.
|
Σειρά: | Lecture Notes in Computer Science,
3860 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Attacks on AES
- Cache Attacks and Countermeasures: The Case of AES
- Related-Key Impossible Differential Attacks on 8-Round AES-192
- Identification
- Session Corruption Attack and Improvements on Encryption Based MT-Authenticators
- Fair Identification
- Algebra
- Efficient Doubling on Genus 3 Curves over Binary Fields
- Another Look at Small RSA Exponents
- Integrity
- Collision-Resistant Usage of MD5 and SHA-1 Via Message Preprocessing
- RFID-Tags for Anti-counterfeiting
- Public Key Encryption
- A “Medium-Field” Multivariate Public-Key Encryption Scheme
- A New Security Proof for Damgård’s ElGamal
- Signatures
- Stand-Alone and Setup-Free Verifiably Committed Signatures
- Toward the Fair Anonymous Signatures: Deniable Ring Signatures
- Side-Channel Attacks
- Practical Second-Order DPA Attacks for Masked Smart Card Implementations of Block Ciphers
- Higher Order Masking of the AES
- CCA Encryption
- Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles
- How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
- Message Authentication
- On the (Im)possibility of Blind Message Authentication Codes
- An Optimal Non-interactive Message Authentication Protocol
- Block Ciphers
- A New Criterion for Nonlinearity of Block Ciphers
- Block Ciphers Sensitive to Gröbner Basis Attacks
- Multi-party Computation
- Universally Composable Oblivious Transfer in the Multi-party Setting
- A Round and Communication Efficient Secure Ranking Protocol.