| Title |
Authors |
Affiliations |
| A memory efficient version of Satoh's algorithm
|
Frederik Vercauteren, Bart Preneel, Joos
Vandewalle |
K.U. Leuven, Elektrotechniek-ESAT/COSIC,
Belgium |
| A three-move blind signature scheme secure
up to polynomial number of issuing |
Masayuki Abe |
NTT Laboratories, 1-1 Hikari-no-oka Yokosuka,
239-0847, Japan |
| Analysis of Key-Exchange Protocols and Their
Use for Building Secure Channels |
Ran Canetti, Hugo Krawczyk |
Ran Canetti, IBM T.J. Watson Research Center,
USA Hugo Krawczyk, Technion, Israel |
| Assumptions Related to Discrete Logarithms:
Why Subtelties Make a Difference |
Ahmad-Reza Sadeghi, Michael Steiner |
Ahmad-Reza Sadeghi, FR Informatik, Universit\"at
des Saarlandes, Saarbr\"ucken, Germany Michael Steiner,
FR Informatik, Universit\"at des Saarlandes, Saarbr\"ucken,
Germany |
| Cryptanalysis of Reduced-Round MISTY |
Ulrich Kuehn |
Dresdner Bank AG |
| Cryptographic Counters and Applications to
Electronic Voting |
Jonathan Katz, Steven Myers, Rafail Ostrovsky |
Jonathan Katz, Columbia University, USA (work
done while at Telcordia Technologies, USA) Steven Myers, University
of Toronto, Canada (work done while at Telcordia Technologies,
USA) Rafail Ostrovsky, Telcordia Technologies, USA |
| Does encryption with redundancy provide authenticity? |
Jee Hea An, Mihir Bellare |
University of California at San Diego, USA |
| Efficient Amplification of the Security of
Weak Pseudo-Random Function Generators |
Steven Myers |
Dept. Of Computer Science, University Of
Toronto, Toronto, Ontario, Canada |
| Efficient Non-Interactive and Non-Malleable
Commitment Schemes |
Giovanni Di Crescenzo, Jonathan Katz, Rafail
Ostrovsky, Adam Smith |
1. Telcordia Technologies, USA 2. Columbia
University , USA (work done while at Telcordia Technologies,
USA) 3. Telcordia Technologies, USA 4. Massachusetts Institute
of Technology, USA (work done while at Telcordia Technologies,
USA) |
| Efficient Non-transferable Anonymous Multi-show
Credential System with Optional Anonymity Revocation |
Jan Camenisch, Anna Lysyanskaya |
Jan Camenisch, IBM Research, Zurich Research
Laboratory, Switzerland Anna Lysyanskaya, Massachusetts Institute
of Technology, USA |
| Encryption Modes with Almost Free Message
Integrity |
Charanjit S. Jutla |
IBM T.J. Watson Research Center |
| Evidence that XTR is more secure than supersingular
elliptic curve cryptosystems |
Eric R. Verheul |
PricewaterhouseCoopers, The Netherlands |
| Finding secure curves with the Satoh-FGH
algorithm and an early-abort strategy |
Mireille Fouquet, Pierrick Gaudry, Robert
Harley |
* Mireille Fouquet: LIX, Ecole polytechnique
* Pierrick Gaudry: LIX, Ecole polytechnique * Robert Harley:
ArgoTech |
| Hash Functions: From Merkle-Damgård
to Shoup |
Ilya Mironov |
Stanford University |
| How secure are elliptic curves over composite
extension fields? |
Nigel Smart |
Nigel P. Smart, Computer Science Department,
University of Bristol |
| How to Convert a Flavor of Quantum Bit Commitment |
Claude Crépeau, Frédéric
Légaré, Louis Salvail |
Claude Crepeau, McGill University, Montreal,
Canada Frederic Legare, Zero-Knowledge Systems, Montreal, Canada
Louis Salvail, BRICS, University of Aarhus, Aarhus, Denmark. |
| Hyper-Bent Functions |
Amr Youssef, Guang Gong |
Center for Applied Cryptographic Research
Department of Combinatorics and Optimization University of Waterloo
Waterloo, Ontario N2L 3G1, CANADA |
| Identification Protocols Secure Against Reset
Attacks |
Mihir Bellare, Marc Fischlin, Shafi Goldwasser,
Silvio Micali |
Mihir Bellare (University of California at
San Diego, USA) Marc Fischlin (University of Frankfurt, Germany)
Shafi Goldwasser (Massachusetts Institute of Technology, USA)
Silvio Micali (Massachusetts Institute of Technology, USA) |
| Key Recovery and Message Attacks on NTRU-Composite |
Craig Gentry |
|
| Lower Bounds for Multicast Message Authentication |
Dan Boneh, Glenn Durfee, Matt Franklin |
First two authors are from Stanford University.
Last author is from University of California, Davis. |
| Min-Round Resettable Zero-Knowledge in the
Public-Key Model |
Silvio Micali, Leonid Reyzin |
Massachussetts Institute of Technology |
| Multiparty Computation from Threshold Homomorphic
Encryption |
Ronald Cramer, Ivan Damgård, Jesper
Buus Nielsen |
BRICS Department of Computer Science University
of Aarhus Ny Munkegade DK-8000 Arhus C, Denmark |
| New Method for Upper Bounding the Maximum
Average Linear Hull Probability for SPNs |
Liam Keliher, Henk Meijer, Stafford Tavares |
Liam Keliher and Henk Meijer: Department
of Computing and Information Science, Queen's University, Kingston,
Ontario, Canada Stafford Tavares: Department of Electrical and
Computer Engineering, Queen's University, Kingston, Ontario,
Canada |
| NSS: An NTRU Lattice-Based Signature Scheme |
Jeffrey Hoffstein, Jill Pipher, Joseph Silverman |
Jeffrey Hoffstein NTRU Cryptosystems, Inc.
and Brown University Jill Pipher NTRU Cryptosystems, Inc. and
Brown University Joseph H. Silverman NTRU Cryptosystems, Inc.
and Brown University |
| On adaptive vs. non-adaptive security of
multiparty protocols |
Ran Canetti, Ivan Damgård, Stefan Dziembowski,
Yuval Ishai, Tal Malkin |
Ran Canetti IBM Watson Ivan Damgård
U. Arhus Stefan Dziembowski U. Arhus Yuval Ishai DIMACS and
AT&T Tal Malkin AT&T |
| On perfect and adaptive security in exposure-resilient
cryptography |
Yevgeniy Dodis, Amit Sahai, Adam Smith |
Yevgeniy Dodis, NYU and IBM Amit Sahai, Princeton
University Adam Smith, MIT |
| Practical Password-Authenticated Key Exchange
Provably Secure under Standard Assumptions |
Jonathan Katz, Rafail Ostrovsky, Moti Yung |
Jonathan Katz, Columbia University, USA (work
done while at Telcordia Technologies, USA) Rafail Ostrovsky,
Telcordia Technologies, USA Moti Yung, CertCo, USA |
| Practical Threshold RSA Signatures Without
a Trusted Dealer |
Ivan Damgård, Maciej Koprowski |
BRICS, University of Aarhus, Denmark |
| Priced Oblivious Transfer: How to Sell Digital
Goods |
Bill Aiello, Yuval Ishai, Omer Reingold |
Bill Aiello (AT&T) and Yuval Ishai (AT&T
and DIMACS) and Omer Reingold (AT&T) |
| Structural Cryptanalysis of SASAS |
Alex Biryukov, Adi Shamir |
Computer Science department, The Weizmann
Institute |
| The Bit Security of Paillier's Encryption
Scheme and its Applications |
Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham |
Dario Catalano, Dipartimento di Matematica
e Informatica, Universita' di Catania, Italy Rosario Gennaro
and Nick Howgrave-Graham, IBM T.J.Watson Research Center |
| The Rectangle Attack - Rectangling the Serpent |
Eli Biham, Orr Dunkelman, Nathan Keller |
Eli Biham, Computer Science Dept., Technion
- Israeli Institute of Technology. Orr Dunkelman, Computer Science
Dept., Technion - Israeli Institute of Technology. Nathan Keller,
Dept. of Mathematics, Technion - Israeli Institute of Technology. |
