Abstract is missing.
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete LogPascal Paillier, Damien Vergnaud. 1-20 [doi]
- Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?David Jao, Stephen D. Miller, Ramarathnam Venkatesan. 21-40 [doi]
- Adapting Density Attacks to Low-Weight KnapsacksPhong Q. Nguyen, Jacques Stern. 41-58 [doi]
- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base ChainsVassil S. Dimitrov, Laurent Imbert, Pradeep Kumar Mishra. 59-78 [doi]
- Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty ComputationMartin Hirt, Jesper Buus Nielsen. 79-99 [doi]
- Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient InstantiationsNuttapong Attrapadung, Hideki Imai. 100-120 [doi]
- Revealing Additional Information in Two-Party ComputationsAndreas Jakoby, Maciej Liskiewicz. 121-135 [doi]
- Gate Evaluation Secret Sharing and Secure One-Round Two-Party ComputationVladimir Kolesnikov. 136-155 [doi]
- Parallel Multi-party Computation from Linear Multi-secret Sharing SchemesZhifang Zhang, Mulan Liu, Liangliang Xiao. 156-173 [doi]
- Updatable Zero-Knowledge DatabasesMoses Liskov. 174-198 [doi]
- Simple and Tight Bounds for Information Reconciliation and Privacy AmplificationRenato Renner, Stefan Wolf. 199-216 [doi]
- Quantum Anonymous TransmissionsMatthias Christandl, Stephanie Wehner. 217-235 [doi]
- Privacy-Preserving Graph Algorithms in the Semi-honest ModelJustin Brickell, Vitaly Shmatikov. 236-252 [doi]
- Spreading Alerts Quietly and the Subgroup Escape ProblemJames Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy. 253-272 [doi]
- A Sender Verifiable Mix-Net and a New Proof of a ShuffleDouglas Wikström. 273-292 [doi]
- Universally Anonymizable Public-Key EncryptionRyotaro Hayashi, Keisuke Tanaka. 293-312 [doi]
- Fast Computation of Large Distributions and Its Cryptographic ApplicationsAlexander Maximov, Thomas Johansson. 313-332 [doi]
- An Analysis of the XSL AlgorithmCarlos Cid, Gaëtan Leurent. 333-352 [doi]
- New Applications of Time Memory Data TradeoffsJin Hong, Palash Sarkar. 353-372 [doi]
- Linear Cryptanalysis of the TSC Family of Stream CiphersFrédéric Muller, Thomas Peyrin. 373-394 [doi]
- A Practical Attack on the Fixed RC4 in the WEP ModeItsik Mantin. 395-411 [doi]
- A Near-Practical Attack Against B Mode of HBBJoydip Mitra. 412-424 [doi]
- New Improvements of Davies-Murphy CryptanalysisSébastien Kunz-Jacques, Frédéric Muller. 425-442 [doi]
- A Related-Key Rectangle Attack on the Full KASUMIEli Biham, Orr Dunkelman, Nathan Keller. 443-461 [doi]
- Some Attacks Against a Double Length Hash ProposalLars R. Knudsen, Frédéric Muller. 462-473 [doi]
- A Failure-Friendly Design Principle for Hash FunctionsStefan Lucks. 474-494 [doi]
- Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its ApplicationYumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, Hideki Imai. 495-514 [doi]
- Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear MapsPaulo S. L. M. Barreto, Benoît Libert, Noel McCullagh, Jean-Jacques Quisquater. 515-532 [doi]
- Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear MapsToru Nakanishi, Nobuo Funabiki. 533-548 [doi]
- Modular Security Proofs for Key Agreement ProtocolsCaroline Kudla, Kenneth G. Paterson. 549-565 [doi]
- A Simple Threshold Authenticated Key Exchange from Short SecretsMichel Abdalla, Olivier Chevassut, Pierre-Alain Fouque, David Pointcheval. 566-584 [doi]
- Examining Indistinguishability-Based Proof Models for Key Establishment ProtocolsKim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock. 585-604 [doi]
- Server-Aided Verification: Theory and PracticeMarc Girault, David Lefranc. 605-623 [doi]
- Errors in Computational Complexity Proofs for ProtocolsKim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock. 624-643 [doi]
- Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature)Joonsang Baek, Reihaneh Safavi-Naini, Willy Susilo. 644-661 [doi]
- Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge ProofsCraig Gentry, David Molnar, Zulfikar Ramzan. 662-681 [doi]
- Universally Convertible Directed SignaturesFabien Laguillaumie, Pascal Paillier, Damien Vergnaud. 682-701 [doi]