Abstract is missing.
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective OpeningMihir Bellare, Dennis Hofheinz, Scott Yilek. 1-35 [doi]
- Breaking RSA Generically Is Equivalent to FactoringDivesh Aggarwal, Ueli Maurer. 36-53 [doi]
- Resettably Secure ComputationVipul Goyal, Amit Sahai. 54-71 [doi]
- On the Security Loss in Cryptographic ReductionsChi-Jen Lu. 72-87 [doi]
- On Randomizing Hash Functions to Strengthen the Security of Digital SignaturesPraveen Gauravaram, Lars R. Knudsen. 88-105 [doi]
- Cryptanalysis of MDC-2Lars R. Knudsen, Florian Mendel, Christian Rechberger, Søren S. Thomsen. 106-120 [doi]
- Cryptanalysis on HMAC/NMAC-MD5 and MD5-MACXiaoyun Wang, Hongbo Yu, Wei Wang, Haina Zhang, Tao Zhan. 121-133 [doi]
- Finding Preimages in Full MD5 Faster Than Exhaustive SearchYu Sasaki, Kazumaro Aoki. 134-152 [doi]
- Asymmetric Group Key AgreementQianhong Wu, Yi Mu, Willy Susilo, Bo Qin, Josep Domingo-Ferrer. 153-170 [doi]
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)Craig Gentry, Brent Waters. 171-188 [doi]
- Traitors Collaborating in Public: Pirates 2.0Olivier Billet, Duong Hieu Phan. 189-205 [doi]
- Key Agreement from Close Secrets over Unsecured ChannelsBhavana Kanukurthi, Leonid Reyzin. 206-223 [doi]
- Order-Preserving Symmetric EncryptionAlexandra Boldyreva, Nathan Chenette, YounHo Lee, Adam O Neill. 224-241 [doi]
- A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday BarrierKan Yasuda. 242-259 [doi]
- On the Security of Cryptosystems with Quadratic Decryption: The Nicest CryptanalysisGuilhem Castagnos, Fabien Laguillaumie. 260-277 [doi]
- Cube Attacks on Tweakable Black Box PolynomialsItai Dinur, Adi Shamir. 278-299 [doi]
- Smashing SQUASH-0Khaled Ouafi, Serge Vaudenay. 300-312 [doi]
- Practical Chosen Ciphertext Secure Encryption from FactoringDennis Hofheinz, Eike Kiltz. 313-332 [doi]
- Realizing Hash-and-Sign Signatures under Standard AssumptionsSusan Hohenberger, Brent Waters. 333-350 [doi]
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext AttacksJan Camenisch, Nishanth Chandran, Victor Shoup. 351-368 [doi]
- Cryptography without (Hardly Any) Secrets ?Shafi Goldwasser. 369-370 [doi]
- Salvaging Merkle-Damgård for Practical ApplicationsYevgeniy Dodis, Thomas Ristenpart, Thomas Shrimpton. 371-388 [doi]
- On the Security of Padding-Based Encryption Schemes - or - Why We Cannot Prove OAEP Secure in the Standard ModelEike Kiltz, Krzysztof Pietrzak. 389-406 [doi]
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters IBE SchemeMihir Bellare, Thomas Ristenpart. 407-424 [doi]
- On the Portability of Generalized Schnorr ProofsJan Camenisch, Aggelos Kiayias, Moti Yung. 425-442 [doi]
- A Unified Framework for the Analysis of Side-Channel Key Recovery AttacksFrançois-Xavier Standaert, Tal Malkin, Moti Yung. 443-461 [doi]
- A Leakage-Resilient Mode of OperationKrzysztof Pietrzak. 462-482 [doi]
- ECM on Graphics CardsDaniel J. Bernstein, Tien-Ren Chen, Chen-Mou Cheng, Tanja Lange, Bo-Yin Yang. 483-501 [doi]
- Double-Base Number System for Multi-scalar MultiplicationsChristophe Doche, David R. Kohel, Francesco Sica. 502-517 [doi]
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of CurvesSteven D. Galbraith, Xibin Lin, Michael Scott. 518-535 [doi]
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite FieldsTakakazu Satoh. 536-553 [doi]
- Verifiable Random Functions from Identity-Based Key EncapsulationMichel Abdalla, Dario Catalano, Dario Fiore. 554-571 [doi]
- Optimal Randomness Extraction from a Diffie-Hellman ElementCéline Chevalier, Pierre-Alain Fouque, David Pointcheval, Sébastien Zimmer. 572-589 [doi]
- A New Randomness Extraction Paradigm for Hybrid EncryptionEike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung. 590-609 [doi]