Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarIACR Cryptology ePrint Archive, Volume 2005
Volume 2005, 2005
- Jason E. Holt, Kent E. Seamons:
Logcrypt: Forward Security and Public Verification for Secure Audit Logs. 2 - Hung-Yu Chien:
Comments: Insider attack on Cheng et al.'s pairing-based tripartite key agreement protocols. 13 - Dan Boneh, Xavier Boyen, Eu-Jin Goh:
Hierarchical Identity Based Encryption with Constant Size Ciphertext. 15 - Roberto Maria Avanzi:
Side Channel Attacks on Implementations of Curve-Based Cryptographic Primitives. 17 - Dan Boneh, Craig Gentry, Brent Waters:
Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys. 18 - Romain Janvier, Yassine Lakhnech, Laurent Mazaré:
(De)Compositions of Cryptographic Schemes and their Applications to Protocols. 20 - ChangKyun Kim, JaeCheol Ha, Sang-Jae Moon, Sung-Ming Yen, Wei-Chih Lien, Sung-Hyun Kim:
An Improved and Efficient Countermeasure against Power Analysis Attacks. 22 - Masao Kasahara:
A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness. 23 - Qingshu Meng, Min Yang, Huanguo Zhang, Yuzhen Liu:
Analysis of Affinely Equivalent Boolean Functions. 25 - Masayuki Abe, Rosario Gennaro, Kaoru Kurosawa:
Tag-KEM/DEM: A New Framework for Hybrid Encryption. 27 - Giuseppe Ateniese, Kevin Fu, Matthew Green, Susan Hohenberger:
Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage. 28 - Boaz Barak, Shai Halevi:
A model and architecture for pseudo-random generation with applications to /dev/random. 29 - A. A. Kalele, V. R. Sule:
Weak keys of the Diffie Hellman key exchange II : Pairing based schemes on elliptic curves. 30 - Iwan M. Duursma, Negar Kiyavash:
The Vector Decomposition Problem for Elliptic and Hyperelliptic Curves. 31 - Dennis Hofheinz, Dominique Unruh:
On the Notion of Statistical Security in Simulatability Definitions. 32 - Gene Tsudik, Shouhuai Xu:
Flexible Framework for Secret Handshakes (Multi-Party Anonymous and Un-observable Authentication). 34 - Benoît Chevallier-Mames:
An Efficient CDH-based Signature Scheme With a Tight Security Reduction. 35 - Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran:
Concurrent Composition of Secure Protocols in the Timing Model. 36 - Claude Castelluccia, Einar Mykletun, Gene Tsudik:
Improving Secure Server Performance by Re-balancing SSL/TLS Handshakes. 37 - (Withdrawn) Cryptanalysis of improvement of digital signature with message recovery using self-certified public keys and its variants. 38
- O. A. Logachev, A. A. Salnikov, V. V. Yashchenko:
Polyhedrons over Finite Abelian Groups and Their Cryptographic Applications. 42 - Hsiao-Ying Lin, Wen-Guey Tzeng:
An Efficient Solution to The Millionaires' Problem Based on Homomorphic Encryption. 43 - Nick Howgrave-Graham, Joseph H. Silverman, William Whyte:
Choosing Parameter Sets for NTRUEncrypt with NAEP and SVES-3. 45 - Qiang Tang, Chris J. Mitchell:
Cryptanalysis of an anonymous wireless authentication and conference key distribution scheme. 47 - Qiang Tang, Chris J. Mitchell:
Cryptanalysis of two identification schemes based on an ID-based cryptosystem. 48 - Ziv Kfir, Avishai Wool:
Picking Virtual Pockets using Relay Attacks on Contactless Smartcard Systems. 52 - (Withdrawn) Comment on cryptanalysis of Tseng et al.¡¦s authenticated encryption schemes. 54
- Kamel Bentahar, Pooya Farshim, John Malone-Lee, Nigel P. Smart:
Generic Constructions of Identity-Based and Certificateless KEMs. 58 - Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, David Pointcheval:
Key Derivation and Randomness Extraction. 61 - (Withdrawn) Cryptanalysis of One Fair E-cash System. 62
- (Withdrawn) On the Key Schedule of Blowfish. 63
- Tim Kerins, William P. Marnane, Emanuel M. Popovici, Paulo S. L. M. Barreto:
Efficient hardware for the Tate pairing calculation in characteristic three. 65 - Eike Kiltz:
Unconditionally Secure Constant Round Multi-Party Computation for Equality, Comparison, Bits and Exponentiation. 66 - Zhaneta Tasheva, Borislav Bedzhev, Borislav Stoyanov:
N-adic Summation-Shrinking Generator. Basic properties and empirical evidences. 68 - Vassil S. Dimitrov, Laurent Imbert, P. K. Mishra:
Fast Elliptic Curve Point Multiplication using Double-Base Chains. 69 - Jean-Camille Birget, Spyros S. Magliveras, Michal Sramka:
On public-key cryptosystems based on combinatorial group theory. 70 - (Withdrawn) A fast parallel scalar multiplication against side-channel analysis for elliptic curve cryptosystem over prime fields. 71
- Mathieu Baudet, Véronique Cortier, Steve Kremer:
Computationally sound implementations of equational theories against passive adversaries. 74 - Christopher Wolf, Bart Preneel:
Taxonomy of Public Key Schemes based on the problem of Multivariate Quadratic equations. 77 - Marius-Calin Silaghi:
Zero-Knowledge Proofs for Mix-nets of Secret Shares and a Version of ElGamal with Modular Homomorphism. 79 - R. Venkatesh, C. Sanjeevakumar, M. Kasi Rajan, L. Sudarsan, N. Srinivasan:
A QKD Protocol Extendable to Support Entanglement and Reduce Unauthorized Information Gain by Randomizing the Bases Lists with Key Values and Invalidate Explicit Privacy Amplification. 80 - (Withdrawn) Smashing SMASH. 81
- (Withdrawn) A new structural attack for GPT and variants. 85
- Rostovtsev A. G., Shemyakina O. V.:
AES side channel attack protection using random isomorphisms. 87 - Hans Dobbertin, Gregor Leander:
Cryptographer's Toolkit for Construction of 8-Bit Bent Functions. 89 - M. Choudary Gorantla, Raju Gangishetti, Ashutosh Saxena:
A Survey on ID-Based Cryptographic Primitives. 94 - Yassine Lakhnech, Laurent Mazaré:
Computationally Sound Verification of Security Protocols Using Diffie-Hellman Exponentiation. 97 - Yassine Lakhnech, Laurent Mazaré:
Probabilistic Opacity for a Passive Adversary and its Application to Chaum's Voting Scheme. 98 - Miodrag J. Mihaljevic, Marc P. C. Fossorier, Hideki Imai:
Time-Data-Memory Trade-Off Based Cryptanalysis of Certain Broadcast Encryption Schemes. 99 - Qingshu Meng, Huanguo Zhang, Jingsong Cui, Min Yang:
almost enumeration of 8-variable bent functions. 100 - Fangguo Zhang, Xiaofeng Chen:
Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05. 103 - Nick Howgrave-Graham, Jeffrey Hoffstein, Jill Pipher, William Whyte:
On estimating the lattice security of NTRU. 104 - Boaz Barak, Amit Sahai:
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. 106 - Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasizadeh:
Weak Composite Diffie-Hellman is not Weaker than Factoring. 111 - Nigel P. Smart, Frederik Vercauteren:
On Computable Isomorphisms in Efficient Asymmetric Pairing Based Systems. 116 - Malapati Raja Sekhar, Takeshi Okamoto, Eiji Okamoto:
On Designatedly Verified (Non-interactive) Watermarking Schemes. 120 - Julie Thorpe, Paul C. van Oorschot, Anil Somayaji:
Pass-thoughts: Authenticating With Our Minds. 121 - Xinyi Huang, Willy Susilo, Yi Mu:
Breaking and Repairing Trapdoor-free Group Signature Schemes from Asiacrypt 2004. 122 - Lan Nguyen:
Accumulators from Bilinear Pairings and Applications to ID-based Ring Signatures and Group Membership Revocation. 123 - Shahram Khazaei, Mahmoud Salmasizadeh, Javad Mohajeri:
On the Statistically Optimal Divide and Conquer Correlation Attack on the Shrinking Generator. 126 - Thomas Groß, Birgit Pfitzmann, Ahmad-Reza Sadeghi:
Browser Model for Security Analysis of Browser-Based Protocols. 127 - (Withdrawn) Improve the Behavior of XL Family by Reducing the Excrescent Multiply Monomials. 128
- Zhaohui Cheng, Manos Nistazakis, Richard Comley, Luminita Vasiu:
On The Indistinguishability-Based Security Model of Key Agreement Protocols-Simple Cases. 129 - (Withdrawn) Results on Rotation Symmetric Boolean Functions on Even Number Variable. 130
- Jacques Patarin, Paul Camion:
Design of near-optimal pseudorandom functions and pseudorandom permutations in the information-theoretic model. 135 - Jung Hee Cheon, Nam-Su Jho, Myung-Hwan Kim, Eun Sun Yoo:
Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption. 136 - Ivan Damgård, Matthias Fitzi, Jesper Buus Nielsen, Tomas Toft:
How to Split a Shared Secret into Shared Bits in Constant-Round. 140