default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIACR Cryptology ePrint Archive, Volume 2009
Volume 2009, 2009
- Brian Baldwin, Richard Moloney, Andrew Byrne, Gary McGuire, William P. Marnane:
A Hardware Analysis of Twisted Edwards Curves for an Elliptic Curve Cryptosystem. 1 - Julien Brouchier, Nora Dabbous, Tom Kean, Carol Marsh, David Naccache:
Thermocommunication. 2 - Long Hoang Nguyen, A. W. Roscoe:
Separating two roles of hashing in one-way message authentication. 3 - (Withdrawn) On Stateless Schemes for Message Authentication Using Pseudorandom Functions. 4
- Wei Wang, Xiaoyun Wang, Guangwu Xu:
Impossible Differential Cryptanalysis of Pelican, MT-MAC-AES and PC-MAC-AES. 5 - Vlastimil Klíma:
Huge Multicollisions and Multipreimages of Hash Functions BLENDER-n. 6 - Jens Groth:
Homomorphic Trapdoor Commitments to Group Elements. 7 - Roman Popovych:
A note on Agrawal conjecture. 8 - Christoph Lucas, Dominik Raub, Ueli Maurer:
Hybrid-Secure MPC: Trading Information-Theoretic Robustness for Computational Privacy. 9 - Zhibin Zhou, Dijiang Huang:
Optimal Multicast Group Communication. 10 - David Canright, Lejla Batina:
A Very Compact "Perfectly Masked" S-Box for AES (corrected). 11 - David Canright:
Avoid Mask Re-use in Masked Galois Multipliers. 12 - Yehuda Lindell:
Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1. 13 - Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson:
Key Predistribution Techniques for Grid-Based Wireless Sensor Networks. 14 - S. S. Bedi, N. Rajesh Pillai:
Cube Attacks on Trivium. 15 - Neil Costigan, Peter Schwabe:
Fast elliptic-curve cryptography on the Cell Broadband Engine. 16 - Chunbo Ma, Jun Ao:
Anonymous signature scheme. 17 - Prasanth Kumar Thandra, S. A. V. Satya Murty:
Huge 2ndpreimages and collisions of khichidi-1. 18 - Matthew K. Franklin, Mark A. Gondree, Payman Mohassel:
Communication-Efficient Private Protocols for Longest Common Subsequence. 19 - Jiali Choy, Khoongming Khoo, Chuan-Wen Loe:
Applying Time-Memory-Data Trade-Off to Meet-in-the-Middle Attack. 20 - Julien Cathalo, David Naccache, Jean-Jacques Quisquater:
Comparing With RSA. 21 - Roman Popovych:
Correctness of Li Generalization of RSA Cryptosystem. 22 - Dennis Hofheinz, Dominique Unruh, Jörn Müller-Quade:
Polynomial Runtime and Composability. 23 - Emmanuelle Dottax
, Christophe Giraud, Matthieu Rivain, Yannick Sierra:
On Second-Order Fault Analysis Resistance for CRT-RSA Implementations. 24 - Ee-Chien Chang, Chee Liang Lim, Jia Xu:
Short Redactable Signatures Using Random Trees. 25 - Zhimin Li, Licheng Wang, Daofeng Li, Yixian Yang:
Collision Attacks on NaSHA-384/512. 26 - Markus Rückert, Dominique Schröder:
Security of Verifiably Encrypted Signatures. 27 - Susan Hohenberger, Brent Waters:
Realizing Hash-and-Sign Signatures under Standard Assumptions. 28 - Marius Oliver Gheorghita:
Nofish - A new stream cipher. 29 - Boris Skoric, Pim Tuyls:
An efficient fuzzy extractor for limited noise. 30 - Yehuda Lindell:
Adaptively Secure Two-Party Computation with Erasures. 31 - Shigeo Mitsunari:
A Fast Implementation of etaT Pairing in Characteristic Three on Intel Core 2 Duo Processor. 32 - Yaser Esmaeili Salehani, Amir Tabatabaei, Mohammad Reza Sohizadeh Abyaneh, Mehdi M. Hassanzadeh:
NESHA-256, NEw 256-bit Secure Hash Algorithm (Extended Abstract). 33 - Smile Markovski, Aleksandra Mileva, Vesna Dimitrova, Danilo Gligoroski:
On a Conditional Collision Attack on NaSHA-512. 34 - Xiaofeng Chen, Fangguo Zhang, Haibo Tian, Baodian Wei, Kwangjo Kim:
Key-Exposure Free Chameleon Hashing and Signatures Based on Discrete Logarithm Systems. 35 - Carmit Hazay, Yehuda Lindell:
Constructions of Truly Practical Secure Protocols using Standard Smartcards. 36 - M. Jason Hinek, Charles C. Y. Lam:
Common Modulus Attacks on Small Private Exponent RSA and Some Fast Variants (in Practice). 37 - Bhupendra Singh, Lexy Alexander, Sanjay Burman:
On Algebraic Relations of Serpent S-Boxes. 38 - Mihir Bellare, Shanshan Duan, Adriana Palacio:
Key Insulation and Intrusion Resilience Over a Public Channel. 39 - Yusuke Naito, Kazuki Yoneyama, Lei Wang, Kazuo Ohta:
How to Prove the Security of Practical Cryptosystems with Merkle-Damgård Hashing by Adopting Indifferentiability. 40 - Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs:
Proofs of Retrievability via Hardness Amplification. 41 - Lilya Budaghyan, Claude Carlet:
On CCZ-equivalence and its use in secondary constructions of bent functions. 42 - Karthik Chandrashekar Iyer, Aravinda Subramanya:
Image Encryption by Pixel Property Separation. 43 - Dmitry Frumkin, Adi Shamir:
Un-Trusted-HB: Security Vulnerabilities of Trusted-HB. 44 - Carmit Hazay, Yehuda Lindell:
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. 45 - Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng:
Traceability Codes. 46 - Palash Sarkar:
On Approximating Addition by Exclusive OR. 47 - Palash Sarkar:
A Trade-Off Between Collision Probability and Key Size in Universal Hashing Using Polynomials. 48 - Aileen Zhang, Chu-Wee Lim, Khoongming Khoo, Lei Wei, Josef Pieprzyk:
Extensions of the Cube Attack based on Low Degree Annihilators. 49 - Jan Camenisch, Aggelos Kiayias, Moti Yung:
On the Portability of Generalized Schnorr Proofs. 50 - Mohammad Reza Reyhanitabar, Willy Susilo, Yi Mu:
Enhanced Target Collision Resistant Hash Functions Revisited. 51 - S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan:
ON THE SECURITY OF TWO RING SIGNCRYPTION SCHEMES. 52 - Lilya Budaghyan, Tor Helleseth:
New commutative semifields defined by PN multinomials. 53 - Ewan Fleischmann, Michael Gorski, Stefan Lucks:
On the Security of Tandem-DM. 54 - Ralf Küsters, Max Tuengerthal:
Universally Composable Symmetric Encryption. 55 - David Kammler, Diandian Zhang, Peter Schwabe, Hanno Scharwächter, Markus Langenberg, Dominik Auras, Gerd Ascheid, Rainer Leupers, Rudolf Mathar, Heinrich Meyr:
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves. 56 - Gregory M. Zaverucha, Douglas R. Stinson:
Anonymity in Shared Symmetric Key Primitives. 57 - Takakazu Satoh:
On Generalization of Cheon's Algorithm. 58 - László Csirmaz:
On the impossibility of graph secret sharing. 59 - Sanjit Chatterjee, Darrel Hankerson, Edward Knapp, Alfred Menezes:
Comparing Two Pairing-Based Aggregate Signature Schemes. 60 - Shigeo Tsujii, Kohtaro Tadaki, Ryou Fujita, Masahito Gotaishi, Toshinobu Kaneko:
Security Enhancement of Various MPKCs by 2-layer Nonlinear Piece In Hand Method. 61 - Subhamoy Maitra, Santanu Sarkar:
On Deterministic Polynomial-Time Equivalence of Computing the CRT-RSA Secret Keys and Factoring. 62 - Lilya Budaghyan, Claude Carlet:
CCZ-equivalence and Boolean functions. 63 - Céline Blondeau, Benoît Gérard:
On the Data Complexity of Statistical Attacks Against Block Ciphers (full version). 64 - Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi:
Foundations of Non-Malleable Hash and One-Way Functions. 65 - Jooyoung Lee, Je Hong Park:
Adaptive Preimage Resistance and Permutation-based Hash Functions. 66 - Chuan-Kun Wu:
On fractional correlation immunity of majority functions. 67 - Johann Barbier, Eric Filiol:
Overview of Turbo-Code Reconstruction Techniques. 68 - Alptekin Küpçü, Anna Lysyanskaya:
Optimistic Fair Exchange with Multiple Arbiters. 69 - Omran Ahmadi, Francisco Rodríguez-Henríquez:
Low Complexity Cubing and Cube Root Computation over F3m in Polynomial Basis. 70 - László Csirmaz, Gábor Tardos:
Secret sharing on trees: problem solved. 71 - Luis J. Dominguez Perez, Ezekiel J. Kachisa, Michael Scott:
Implementing cryptographic pairings: a magma tutorial. 72 - Chun-Xiang Gu, Yan Guang, Yue-Fei Zhu:
Automatic Approach of Provable Security and its Application for OAEP+. 73 - Kirill Morozov, George Savvides:
Computational Oblivious Transfer and Interactive Hashing. 74 - Yusuke Naito, Kazuki Yoneyama, Lei Wang, Kazuo Ohta:
Security of Practical Cryptosystems Using Merkle-Damgard Hash Function in the Ideal Cipher Model. 75 - Zhixiong Chen, Chenhuang Wu:
Construction of large families of pseudorandom subsets using elliptic curves. 76 - Charles Bouillaguet, Orr Dunkelman, Pierre-Alain Fouque, Antoine Joux:
On the Security of Iterated Hashing based on Forgery-resistant Compression Functions. 77 - Stefan Lucks, Andreas Schuler, Erik Tews, Ralf-Philipp Weinmann, Matthias Wenzel:
Attacks on the DECT authentication mechanisms. 78 - David A. Basin, Cas Cremers:
From Dolev-Yao to Strong Adaptive Corruption: Analyzing Security in the Presence of Compromising Adversaries. 79 - Michael Backes, Dennis Hofheinz, Dominique Unruh:
CoSP: A General Framework For Computational Soundness Proofs. 80 - Cong Wang, Qian Wang, Kui Ren, Wenjing Lou:
Ensuring Data Storage Security in Cloud Computing. 81 - Douglas Stebila, Michele Mosca, Norbert Lütkenhaus:
The Case for Quantum Key Distribution. 82 - Vladimir Bozovic, Daniel Socek, Rainer Steinwandt, Viktória I. Villányi:
Multi-authority attribute based encryption with honest-but-curious central authority. 83 - Mihir Bellare, Thomas Ristenpart:
Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme. 84 - Tao Feng, Xian Guo, Jianfeng Ma, Xinghua Li:
UC-Secure Source Routing Protocol. 85 - Philip N. J. Eagle, Steven D. Galbraith, John Ong:
Point Compression for Koblitz Elliptic Curves. 86 - (Withdrawn) Unconditionally Secure Asynchronous Multiparty Computation with Quadratic Communication Per Multiplication Gate. 87
- Brett Hemenway, Benoît Libert, Rafail Ostrovsky, Damien Vergnaud:
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security. 88 - Boris Köpf, Markus Dürmuth:
A Provably Secure And Efficient Countermeasure Against Timing Attacks. 89 - Alexander W. Dent:
A Brief History of Provably-Secure Public-Key Encryption. 90 - Koichiro Noro, Kunikatsu Kobayashi:
Knapsack Cryptosystem on Elliptic Curves. 91 - Jung Hee Cheon, Jeongdae Hong, Gene Tsudik:
Reducing RFID Reader Load with the Meet-in-the-Middle Strategy. 92 - Peter Gazi, Ueli Maurer:
Cascade Encryption Revisited. 93 - Sugata Gangopadhyay, Sumanta Sarkar, Ruchi Telang:
On the Lower Bounds of the Second Order Nonlinearity of some Boolean Functions. 94 - Ernie Brickell, Jiangtao Li:
Enhanced Privacy ID from Bilinear Pairing. 95 - María Isabel González Vasco, Angel L. Pérez del Pozo, Pedro Taborda Duarte:
A note on the security of MST3. 96 - Brian J. Matt:
Identification of Multiple Invalid Signatures in Pairing-based Batched Signatures. 97 - Martin R. Albrecht, Craig Gentry, Shai Halevi, Jonathan Katz:
Attacking Cryptographic Schemes Based on "Perturbation Polynomials". 98 - Hugue Blier, Alain Tapp:
A Single Initialization Server for Multi-Party Cryptography. 99 - Gaetan Bisson, Andrew V. Sutherland:
Computing the endomorphism ring of an ordinary elliptic curve over a finite field. 100 - Mihir Bellare, Scott Yilek:
Encryption Schemes Secure under Selective Opening Attack. 101 - Raphael Overbeck:
A Step Towards QC Blind Signatures. 102 - David Mandell Freeman, Takakazu Satoh:
Constructing pairing-friendly hyperelliptic curves using Weil restriction. 103 - Dieter Schmidt:
1024 - A High Security Software Oriented Block Cipher. 104 - Moni Naor, Gil Segev:
Public-Key Cryptosystems Resilient to Key Leakage. 105 - Yu Sasaki:
A Collision Attack on AURORA-512. 106 - Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya:
Compact E-Cash and Simulatable VRFs Revisited. 107 - Santanu Sarkar, Subhamoy Maitra:
Further Results on Implicit Factoring in Polynomial Time. 108 - Haina Zhang, Xiaoyun Wang:
Cryptanalysis of Stream Cipher Grain Family. 109 - Haina Zhang, Xiaoyun Wang:
On the Security of Stream Cipher CryptMT v3. 110 - Marc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen K. Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger:
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. 111 - Yu Sasaki:
A 2nd-Preimage Attack on AURORA-512. 112 - Niels Ferguson, Stefan Lucks:
Attacks on AURORA-512 and the Double-Mix Merkle-Damgaard Transform. 113 - Anupam Pattanayak, Banshidhar Majhi:
Weakness of Key Predistribution Scheme Proposed by J. Dong et al. 114 - S. Sree Vivek, S. Sharmila Deva Selvi, Deepanshu Shukla, C. Pandu Rangan:
Scalable Compilers for Group Key Establishment : Two/Three Party to Group. 115 - Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Information Theoretically Secure Multi Party Set Intersection Re-Visited. 116 - Alexander Rostovtsev:
Changing probabilities of differentials and linear sums via isomorphisms of ciphers. 117 - Jin Li, Kui Ren, Kwangjo Kim:
A2BE: Accountable Attribute-Based Encryption for Abuse Free Access Control. 118 - Marcel Medwed:
A Continuous Fault Countermeasure for AES Providing a Constant Error Detection Rate. 119 - Danilo Gligoroski, Rune Steinsmo Ødegård:
On the Complexity of Khovratovich et.al's Preimage Attack on Edon-R. 120 - (Withdrawn) Optimized Public Key Infrastructure - A PKI to Support Efficient Document's Signatures. 121
- Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals, Eiji Okamoto, Francisco Rodríguez-Henríquez:
Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers. 122 - N. A. Carella:
On the Complexity of Integer Factorization. 123 - Annika Paus, Ahmad-Reza Sadeghi, Thomas Schneider:
Practical Secure Evaluation of Semi-Private Functions. 124 - Yu Sasaki:
A Full Key Recovery Attack on HMAC-AURORA-512. 125 - Siamak Fayyaz Shahandashti, Reihaneh Safavi-Naini:
Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems. 126 - Itai Dinur, Adi Shamir:
Side Channel Cube Attacks on Block Ciphers. 127 - Lu Xiao, Gregory G. Rose:
Attacks on a Lightweight Cipher Based on a Multiple Recursive Generator. 128 - Emilia Käsper, Peter Schwabe:
Faster and Timing-Attack Resistant AES-GCM. 129 - Yindong Chen, Peizhong Lu:
Constructions of Even-variable Boolean Function with Optimum Algebraic Immunity. 130 - Anupam Pattanayak, Banshidhar Majhi:
Key Predistribution Schemes in Distributed Wireless Sensor Network using Combinatorial Designs Revisited. 131 - (Withdrawn) A New Lattice for Implicit Factoring. 132
- (Withdrawn) Signature Schemes with Bounded Leakage Resilience. 133
- Yindong Chen, Peizhong Lu:
A First Order Recursive Construction of Boolean Function with Optimum Algebraic Immunity. 134 - Gaëtan Leurent:
Practical Key Recovery Attack against Secret-prefix Edon-R. 135 - Yvonne Cliff, Colin Boyd, Juan Manuel González Nieto:
How to Extract and Expand Randomness: A Summary and Explanation of Existing Results. 136 - Nicolas T. Courtois:
The Dark Side of Security by Obscurity and Cloning MiFare Classic Rail and Building Passes Anywhere, Anytime. 137