: Evaluating Security of Voting Schemes in the Universal Composability Framework.
: Exponent Group Signature Schemes and Efficient Identity Based Signature Schemes Based on Pairings.
: The Cramer-Shoup Strong-RSA Signature Scheme Revisited.
: Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications.
Jung Hee Cheon
: A Universal Forgery of Hess's Second ID-based Signature against the Known-message Attack.
: Adaptive chi-square test and its application to some cryptographic problems.
, Amit Sahai
: A Unified Methodology For Constructing Public-Key Encryption Schemes Secure Against Adaptive Chosen-Ciphertext Attack.
: A Variant of the Cramer-Shoup Cryptosystem for Groups with Unknwon Order.
: A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions.
: Secure Channels based on Authenticated Encryption Schemes: A Simple Characterization.
: Improved key recovery of level 1 of the Bluetooth Encryption System.
: Authenticated Identity-Based Encryption.
, Tomás Rosa
: Attack on Private Signature Keys of the OpenPGP Format, PGP(TM) Programs and Other Applications Compatible with OpenPGP.
: On the efficiency of the Clock Control Guessing Attack.
: Towards Provably-Secure Timed E-Commerce: The Trusted Delivery Layer.
Alexander W. Dent
: Adapting the weaknesses of the Random Oracle model to the Generic Group model.
Nicolas T. Courtois
: Higher Order Correlation Attacks, XL algorithm and Cryptanalysis of Toyocrypt.
, Yongxin Zhou
: Generating Large Non-Singular Matrices over an Arbitrary Field with Blocks of Full Rank.
: A new public key encryption scheme provably secure against adaptive chosen cipher-text attack.
: A New Statistical Testing for Symmetric Ciphers and Hash Functions.
Simon R. Blackburn
: An Upper Bound on the Size of a Code with the k-Identifiable Parent Property.
: Efficient Arithmetic on Hyperelliptic Curves.
: A New Class of Unsafe Primes.
: The GGM Construction does NOT yield Correlation Intractable Function Ensembles.
: A Note on the Bilinear Diffie-Hellman Assumption.
: Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme.
: Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes.
: Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae.
: On Optimal Hash Tree Traversal for Interval Time-Stamping.
: Power of a Public Random Permutation and its Application to Authenticated-Encryption.
: Key-collisions in (EC)DSA: Attacking Non-repudiation.
: Efficient Construction of (Distributed) Verifiable Random Functions.
: Folklore, Practice and Theory of Robust Combiners.
: Inversion-Free Arithmetic on Genus 2 Hyperelliptic Curves.
: The EMD Mode of Operation (A Tweaked, Wide-Blocksize, Strong PRP).
: Weighted Coordinates on Genus 2 Hyperelliptic Curves.
: Cryptology and Physical Security: Rights Amplification in Master-Keyed Mechanical Locks.
Salil P. Vadhan
: On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model.
: Authenticated ID-based Key Exchange and remote log-in with simple token and PIN number.
: Theoretical Use of Cache Memory as a Cryptanalytic Side-Channel.
: Statistical weaknesses in the alleged RC4 keystream generator.
: PECDSA. How to build a DL-based digital signature scheme with the best proven security.