Abstract is missing.
- Efficient Collision Search Attacks on SHA-0Xiaoyun Wang, Hongbo Yu, Yiqun Lisa Yin. 1-16 [doi]
- Finding Collisions in the Full SHA-1Xiaoyun Wang, Yiqun Lisa Yin, Hongbo Yu. 17-36 [doi]
- Pebbling and Proofs of WorkCynthia Dwork, Moni Naor, Hoeteck Wee. 37-54 [doi]
- Composition Does Not Imply Adaptive SecurityKrzysztof Pietrzak. 55-65 [doi]
- On the Discrete Logarithm Problem on Algebraic ToriRobert Granger, Frederik Vercauteren. 66-85 [doi]
- A Practical Attack on a Braid Group Based Cryptographic ProtocolAlexei G. Myasnikov, Vladimir Shpilrain, Alexander Ushakov. 86-96 [doi]
- The Conditional Correlation Attack: A Practical Attack on Bluetooth EncryptionYi Lu 0002, Willi Meier, Serge Vaudenay. 97-117 [doi]
- Unconditional Characterizations of Non-interactive Zero-KnowledgeRafael Pass, Abhi Shelat. 118-134 [doi]
- Impossibility and Feasibility Results for Zero Knowledge with Public KeysJoël Alwen, Giuseppe Persiano, Ivan Visconti. 135-151 [doi]
- Communication-Efficient Non-interactive Proofs of Knowledge with Online ExtractorsMarc Fischlin. 152-168 [doi]
- A Formal Treatment of Onion RoutingJan Camenisch, Anna Lysyanskaya. 169-187 [doi]
- Simple and Efficient Shuffling with Provable Correctness and ZK PrivacyKun Peng, Colin Boyd, Ed Dawson. 188-204 [doi]
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and ExtensionsMichel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi. 205-222 [doi]
- Private Searching on Streaming DataRafail Ostrovsky, William E. Skeith III. 223-240 [doi]
- Privacy-Preserving Set OperationsLea Kissner, Dawn Xiaodong Song. 241-257 [doi]
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private KeysDan Boneh, Craig Gentry, Brent Waters. 258-275 [doi]
- Generic Transformation for Scalable Broadcast Encryption SchemesJung Yeon Hwang, Dong-Hoon Lee, Jongin Lim. 276-292 [doi]
- Authenticating Pervasive Devices with Human ProtocolsAri Juels, Stephen A. Weis. 293-308 [doi]
- Secure Communications over Insecure Channels Based on Short Authenticated StringsSerge Vaudenay. 309-326 [doi]
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing SchemesRonald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró. 327-343 [doi]
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number FieldsRonald Cramer, Serge Fehr, Martijn Stam. 344-360 [doi]
- Secure Computation Without AuthenticationBoaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin. 361-377 [doi]
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom GeneratorIvan Damgård, Yuval Ishai. 378-394 [doi]
- Secure Computation of Constant-Depth Circuits with Applications to Database Search ProblemsOmer Barkol, Yuval Ishai. 395-411 [doi]
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical SchemesAlexandra Boldyreva, Marc Fischlin. 412-429 [doi]
- Merkle-Damgård Revisited: How to Construct a Hash FunctionJean-Sébastien Coron, Yevgeniy Dodis, Cécile Malinaud, Prashant Puniya. 430-448 [doi]
- On the Generic Insecurity of the Full Domain HashYevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrzak. 449-466 [doi]
- New Monotones and Lower Bounds in Unconditional Two-Party ComputationStefan Wolf, Jürg Wullschleger. 467-477 [doi]
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key EncryptionThomas Holenstein, Renato Renner. 478-493 [doi]
- A Quantum Cipher with Near Optimal Key-RecyclingIvan Damgård, Thomas Brochmann Pedersen 0002, Louis Salvail. 494-510 [doi]
- An Efficient CDH-Based Signature Scheme with a Tight Security ReductionBenoît Chevallier-Mames. 511-526 [doi]
- Improved Security Analyses for CBC MACsMihir Bellare, Krzysztof Pietrzak, Phillip Rogaway. 527-545 [doi]
- HMQV: A High-Performance Secure Diffie-Hellman ProtocolHugo Krawczyk. 546-566 [doi]