Topics in Cryptology – CT-RSA 2007: The Cryptographers' Track at the RSA Conference 2007, San Fancisco, CA, USA, February 5-9, 2007, ProceedingsMasayuki Abe Springer Science & Business Media, 22 dec 2006 - 401 pagina's The RSA Conference, with over 15,000 attendees and 300 exhibitors, is the largest computer security event of the year. The Cryptographers’ Track (CT- RSA) is a research conference within the RSA Conference. Starting in 2001, CT-RSA continues to its seventh year and is now regarded as one of the major regularly staged event for presenting the results of cryptographic research to a wide variety of audiences. The proceedings of CT-RSA 2007 contain 25 papers selected from 73 s- missions which cover all the topics of cryptography. All the submissions were reviewed by at least three reviewers, which was possible by the hard work of 23 Program Committee members and many external reviewers listed in the foll- ing pages. The papers were selected as a result of conscientious discussion. The program includes two invited talks, by Michel Rabin and Andrew Odlyzko. I would like to express my gratitude to the Program Committee members, whowereenthusiasticfromtheverybeginningofthis completedproject.Thanks also to the external reviewers including those who completed urgent reviews during the discussion phase. Special thanks to Shai Halevi for providing and maintaining the Web review system. Finally, I would like to thank Burt Kaliski of RSA Laboratories and the Steering Committee for their suggestions and c- tinuous assistance. |
Inhoudsopgave
SymmetricKey Encryption | 1 |
Signatures and Authentication | 31 |
Selecting Secure Passwords | 49 |
HumanIdentification Through Image Evaluation Using Secret | 67 |
Hash Functions | 85 |
Second Preimages for SMASH | 101 |
Directed Transitive Signature Scheme | 129 |
IdentityBased Multisignatures fromRSA | 145 |
Predicting Secret Keys Via Branch Prediction | 225 |
Template Attacks on MaskingResistance Is Futile | 243 |
DifferentialPower Analysis of Stream Ciphers | 257 |
Cache Based Remote Timing Attack on the AES | 271 |
Cryptographic Protocols II | 287 |
Efficient PasswordAuthenticated Key Exchange Based on RSA | 309 |
Nondegrading ErasureTolerant Information Authentication with | 324 |
Digital Signatures II | 338 |
Cryptographic Protocols | 163 |
Compact ECash from Bounded Accumulator | 178 |
Batch Processing of Interactive Proofs | 196 |
SideChannel Attacks | 208 |
How toStrengthenAnyWeakly Unforgeable Signature into a Strongly | 357 |
Efficient Implementation | 372 |
ABitSlice Implementation oftheWhirlpool Hash Function | 385 |
Overige edities - Alles bekijken
Topics in Cryptology – CT-RSA 2007: The Cryptographers' Track at the RSA ... Masayuki Abe Gedeeltelijke weergave - 2007 |
Veelvoorkomende woorden en zinsdelen
accept additional adversary algorithm analysis apply assume assumption attack authentication bits block bound branch cache calls chooses chosen cipher ciphertexts collision communication complexity compute consider constants construct correct cryptographic Cryptology defined definition denote described different directed distribution efficient element encryption entropy equal example execution exists first given graph Guessing hash function Hence implementation initial input instance LNCS matching Note obtain operations oracle output pair parameter password performance permutation points possible practical present prime probability problem proof proposed protocol public key queries random random oracle randomly reduced References respectively returns round runs sends session signature scheme signer signing simulation Springer-Verlag standard step stream strong Table takes template Theorem traces trapdoor unforgeable values variant