Abstract is missing.
- Some Applications of Polynomials for the Design of Cryptographic ProtocolsEyal Kushilevitz. 1-13 [doi]
- Secure Multi-party Computation Made SimpleUeli M. Maurer. 14-28 [doi]
- Forward Secrecy in Password-Only Key Exchange ProtocolsJonathan Katz, Rafail Ostrovsky, Moti Yung. 29-44 [doi]
- Weak Forward Security in Mediated RSAGene Tsudik. 45-54 [doi]
- On the Power of Claw-Free PermutationsYevgeniy Dodis, Leonid Reyzin. 55-73 [doi]
- Equivocable and Extractable Commitment SchemesGiovanni Di Crescenzo. 74-87 [doi]
- An Improved Pseudorandom Generator Based on Hardness of FactoringNenad Dedic, Leonid Reyzin, Salil P. Vadhan. 88-101 [doi]
- Intrusion-Resilient Signatures: Generic Constructions, or Defeating Strong Adversary with Minimal AssumptionsGene Itkis. 102-118 [doi]
- Efficient Re-keying Protocols for Multicast EncryptionGiovanni Di Crescenzo, Olga Kornievskaia. 119-132 [doi]
- On a Class of Key Agreement Protocols Which Cannot Be Unconditionally SecureFrank Niedermeyer, Werner Schindler. 133-145 [doi]
- A Group Key Distribution Scheme with Decentralised User JoinHartono Kurnio, Reihaneh Safavi-Naini, Huaxiong Wang. 146-163 [doi]
- On a Resynchronization Weakness in a Class of Combiners with MemoryYuri L. Borissov, Svetla Nikova, Bart Preneel, Joos Vandewalle. 164-173 [doi]
- On Probability of Success in Linear and Differential CryptanalysisAli Aydin Selçuk, Ali Biçak. 174-185 [doi]
- Differential Cryptanalysis of a Reduced-Round SEEDHitoshi Yanami, Takeshi Shimoyama. 186-198 [doi]
- Medical Information Privacy Assurance: Cryptographic and System AspectsGiuseppe Ateniese, Reza Curtmola, Breno de Medeiros, Darren Davis. 199-218 [doi]
- A Format-Independent Architecture for Run-Time Integrity Checking of Executable CodeLuigi Catuogno, Ivan Visconti. 219-233 [doi]
- How to Repair ESIGNLouis Granboulan. 234-240 [doi]
- Forward-Secure Signatures with Fast Key UpdateAnton Kozlov, Leonid Reyzin. 241-256 [doi]
- Constructing Elliptic Curves with Prescribed Embedding DegreesPaulo S. L. M. Barreto, Ben Lynn, Michael Scott. 257-267 [doi]
- A Signature Scheme with Efficient ProtocolsJan Camenisch, Anna Lysyanskaya. 268-289 [doi]
- Efficient Zero-Knowledge Proofs for Some Practical Graph ProblemsYvo Desmedt, Yongge Wang. 290-302 [doi]
- Reduction Zero-KnowledgeXiaotie Deng, Chan H. Lee, Yunlei Zhao, Hong Zhu. 303-317 [doi]
- A New Notion of Soundness in Bare Public-Key ModelShirley H. C. Cheung, Xiaotie Deng, Chan H. Lee, Yunlei Zhao. 318-325 [doi]
- Robust Information-Theoretic Private Information RetrievalAmos Beimel, Yoav Stahl. 326-341 [doi]
- Trading Players for Efficiency in Unconditional Multiparty ComputationB. Prabhu, K. Srinathan, C. Pandu Rangan. 342-353 [doi]
- Secret Sharing Schemes on Access Structures with Intersection Number Equal to OneJaume Martí-Farré, Carles Padró. 354-363 [doi]