Abstract is missing.
- Essential Algebraic Structure within the AESSean Murphy, Matthew J. B. Robshaw. 1-16 [doi]
- Blockwise-Adaptive Attackers: Revisiting the (In)Security of Some Provably Secure Encryption Models: CBC, GEM, IACBCAntoine Joux, Gwenaëlle Martinet, Frédéric Valette. 17-30 [doi]
- Tweakable Block CiphersMoses Liskov, Ronald L. Rivest, David Wagner. 31-46 [doi]
- The LSD Broadcast Encryption SchemeDani Halevy, Adi Shamir. 47-60 [doi]
- Dynamic Accumulators and Application to Efficient Revocation of Anonymous CredentialsJan Camenisch, Anna Lysyanskaya. 61-76 [doi]
- Provably Secure SteganographyNicholas J. Hopper, John Langford, Luis von Ahn. 77-92 [doi]
- Flaws in Applying Proof Methodologies to Signature SchemesJacques Stern, David Pointcheval, John Malone-Lee, Nigel P. Smart. 93-110 [doi]
- Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption CaseJesper Buus Nielsen. 111-126 [doi]
- On the Security of RSA Encryption in TLSJakob Jonsson, Burton S. Kaliski Jr.. 127-142 [doi]
- Security Analysis of IKE s Signature-Based Key-Exchange ProtocolRan Canetti, Hugo Krawczyk. 143-161 [doi]
- GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent AttacksMihir Bellare, Adriana Palacio. 162-177 [doi]
- On 2-Round Secure Multiparty ComputationRosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin. 178-193 [doi]
- Private Computation - k-Connected versus 1-Connected NetworksMarkus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert. 194-209 [doi]
- Analysis and Improvements of NTRU Encryption PaddingsPhong Q. Nguyen, David Pointcheval. 210-225 [doi]
- Universal Padding Schemes for RSAJean-Sébastien Coron, Marc Joye, David Naccache, Pascal Paillier. 226-241 [doi]
- Cryptanalysis of Unbalanced RSA with Small CRT-ExponentAlexander May. 242-256 [doi]
- Hyper-encryption against Space-Bounded Adversaries from On-Line Strong ExtractorsChi-Jen Lu. 257-271 [doi]
- Optimal Black-Box Secret Sharing over Arbitrary Abelian GroupsRonald Cramer, Serge Fehr. 272-287 [doi]
- A Generalized Birthday ProblemDavid Wagner. 288-303 [doi]
- (Not So) Random Shuffles of RC4Ilya Mironov. 304-319 [doi]
- Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGVJohn Black, Phillip Rogaway, Thomas Shrimpton. 320-335 [doi]
- Supersingular Abelian Varieties in CryptologyKarl Rubin, Alice Silverberg. 336-353 [doi]
- Efficient Algorithms for Pairing-Based CryptosystemsPaulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott. 354-368 [doi]
- Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2Frederik Vercauteren. 369-384 [doi]
- Threshold Password-Authenticated Key ExchangePhilip D. MacKenzie, Thomas Shrimpton, Markus Jakobsson. 385-400 [doi]
- A Threshold Pseudorandom Function Construction and Its ApplicationsJesper Buus Nielsen. 401-416 [doi]
- Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime ProductsJoy Algesheimer, Jan Camenisch, Victor Shoup. 417-432 [doi]
- Hidden Number Problem with the Trace and Bit Security of XTR and LUCWen-Ching W. Li, Mats Näslund, Igor Shparlinski. 433-448 [doi]
- Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext SecurityIvan Damgård, Jesper Buus Nielsen. 449-464 [doi]
- Threshold Ring Signatures and Applications to Ad-hoc GroupsEmmanuel Bresson, Jacques Stern, Michael Szydlo. 465-480 [doi]
- Deniable Ring AuthenticationMoni Naor. 481-498 [doi]
- SiBIR: Signer-Base Intrusion-Resilient SignaturesGene Itkis, Leonid Reyzin. 499-514 [doi]
- Cryptanalysis of Stream Ciphers with Linear MaskingDon Coppersmith, Shai Halevi, Charanjit S. Jutla. 515-532 [doi]
- The Filter-Combiner Model for Memoryless Synchronous Stream CiphersPalash Sarkar. 533-548 [doi]
- A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland ConstructionClaude Carlet. 549-564 [doi]
- Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise ChecksSerge Fehr, Ueli M. Maurer. 565-580 [doi]
- Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion FactorIvan Damgård, Jesper Buus Nielsen. 581-596 [doi]
- Unique Signatures and Verifiable Random Functions from the DH-DDH SeparationAnna Lysyanskaya. 597-612 [doi]
- Security Proof for Partial-Domain Hash Signature SchemesJean-Sébastien Coron. 613-626 [doi]