Abstract is missing.
- A Memory Efficient Version of Satoh s AlgorithmFrederik Vercauteren, Bart Preneel, Joos Vandewalle. 1-13 [doi]
- Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort StrategyMireille Fouquet, Pierrick Gaudry, Robert Harley. 14-29 [doi]
- How Secure Are Elliptic Curves over Composite Extension Fields?Nigel P. Smart. 30-39 [doi]
- Efficient and Non-interactive Non-malleable CommitmentGiovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith. 40-59 [doi]
- How to Convert the Flavor of a Quantum Bit CommitmentClaude Crépeau, Frédéric Légaré, Louis Salvail. 60-77 [doi]
- Cryptographic Counters and Applications to Electronic VotingJonathan Katz, Steven Myers, Rafail Ostrovsky. 78-92 [doi]
- An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity RevocationJan Camenisch, Anna Lysyanskaya. 93-118 [doi]
- Priced Oblivious Transfer: How to Sell Digital GoodsWilliam Aiello, Yuval Ishai, Omer Reingold. 119-135 [doi]
- A Secure Three-Move Blind Signature Scheme for Polynomially Many SignaturesMasayuki Abe. 136-151 [doi]
- Practical Threshold RSA Signatures without a Trusted DealerIvan Damgård, Maciej Koprowski. 152-165 [doi]
- Hash Functions: From Merkle-Damgård to ShoupIlya Mironov. 166-181 [doi]
- Key Recovery and Message Attacks on NTRU-CompositeCraig Gentry. 182-194 [doi]
- Evidence that XTR Is More Secure than Supersingular Elliptic Curve CryptosystemsEric R. Verheul. 195-210 [doi]
- NSS: An NTRU Lattice-Based Signature SchemeJeffrey Hoffstein, Jill Pipher, Joseph H. Silverman. 211-228 [doi]
- The Bit Security of Paillier s Encryption Scheme and Its ApplicationsDario Catalano, Rosario Gennaro, Nick Howgrave-Graham. 229-243 [doi]
- Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real DifferenceAhmad-Reza Sadeghi, Michael Steiner. 244-261 [doi]
- On Adaptive vs. Non-adaptive Security of Multiparty ProtocolsRan Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin. 262-279 [doi]
- Multiparty Computation from Threshold Homomorphic EncryptionRonald Cramer, Ivan Damgård, Jesper Buus Nielsen. 280-299 [doi]
- On Perfect and Adaptive Security in Exposure-Resilient CryptographyYevgeniy Dodis, Amit Sahai, Adam Smith. 301-324 [doi]
- Cryptanalysis of Reduced-Round MISTYUlrich Kühn. 325-339 [doi]
- The Rectangle Attack - Rectangling the SerpentEli Biham, Orr Dunkelman, Nathan Keller. 340-357 [doi]
- Efficient Amplification of the Security of Weak Pseudo-random Function GeneratorsSteven Myers. 358-372 [doi]
- Min-round Resettable Zero-Knowledge in the Public-Key ModelSilvio Micali, Leonid Reyzin. 373-393 [doi]
- Structural Cryptanalysis of SASASAlex Biryukov, Adi Shamir. 394-405 [doi]
- Hyper-bent FunctionsAmr M. Youssef, Guang Gong. 406-419 [doi]
- New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNsLiam Keliher, Henk Meijer, Stafford E. Tavares. 420-436 [doi]
- Lower Bounds for Multicast Message AuthenticationDan Boneh, Glenn Durfee, Matthew K. Franklin. 437-452 [doi]
- Analysis of Key-Exchange Protocols and Their Use for Building Secure ChannelsRan Canetti, Hugo Krawczyk. 453-474 [doi]
- Efficient Password-Authenticated Key Exchange Using Human-Memorable PasswordsJonathan Katz, Rafail Ostrovsky, Moti Yung. 475-494 [doi]
- Identification Protocols Secure against Reset AttacksMihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali. 495-511 [doi]
- Does Encryption with Redundancy Provide Authenticity?Jee Hea An, Mihir Bellare. 512-528 [doi]
- Encryption Modes with Almost Free Message IntegrityCharanjit S. Jutla. 529-544 [doi]