default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIACR Cryptology ePrint Archive, Volume 2008
Volume 2008, 2008
- Shengbao Wang, Zhenfu Cao, Kim-Kwang Raymond Choo, Lihua Wang:
Security Proof for the Improved Ryu-Yoon-Yoo Identity-Based Key Agreement Protocol. 1 - Piyi Yang, Zhenfu Cao, Xiaolei Dong:
Fuzzy Identity Based Signature. 2 - Vlastimil Klíma:
On Collisions of Hash Functions Turbo SHA-2. 3 - Palash Sarkar:
Efficient Tweakable Enciphering Schemes from (Block-Wise) Universal Hash Functions. 4 - François Macé, François-Xavier Standaert, Jean-Jacques Quisquater:
Information Theoretic Evaluation of Side-Channel Resistant Logic Styles. 5 - Ralf Küsters, Max Tuengerthal:
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation. 6 - Colin Boyd, Yvonne Cliff, Juan Manuel González Nieto, Kenneth G. Paterson:
Efficient One-round Key Exchange in the Standard Model. 7 - Zhitu Su, Hui Li, Jianfeng Ma:
Factoring Polynomials for Constructing Pairing-friendly Elliptic Curves. 8 - Jacques Patarin:
Generic Attacks for the Xor of k random permutations. 9 - Jacques Patarin:
A Proof of Security in O(2n) for the Xor of Two Random Permutations. 10 - Ayan Mahalanobis:
A simple generalization of the ElGamal cryptosystem to non-abelian groups II. 11 - Daniel R. L. Brown:
The Encrypted Elliptic Curve Hash. 12 - Daniel J. Bernstein, Peter Birkner, Marc Joye, Tanja Lange, Christiane Peters:
Twisted Edwards Curves. 13 - Jan Camenisch, Gregory Neven, Abhi Shelat:
Simulatable Adaptive Oblivious Transfer. 14 - Anna Lisa Ferrara, Matthew Green, Susan Hohenberger, Michael Østergaard Pedersen:
Practical Short Signature Batch Verification. 15 - Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters:
ECM using Edwards curves. 16 - Alexander Maximov, Dmitry Khovratovich:
New State Recovery Attack on RC4. 17 - Mira Belenkiy:
Disjunctive Multi-Level Secret Sharing. 18 - Steven D. Galbraith, Xibin Lin:
Computing Pairings Using x-Coordinates Only. 19 - Eike Kiltz, Yevgeniy Vahlis:
CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption. 20 - Matthieu Rivain, Emmanuelle Dottax
, Emmanuel Prouff:
Block Ciphers Implementations Provably Secure Against Second Order Side Channel Analysis. 21 - Max Gebhardt, Georg Illies, Werner Schindler:
Computing Almost Exact Probabilities of Differential Hash Collision Paths by Applying Appropriate Stochastic Methods. 22 - Sherman S. M. Chow, Volker Roth, Eleanor Gilbert Rieffel:
General Certificateless Encryption and Timed-Release Encryption. 23 - Sunder Lal, Vandani Verma:
Identity Based Strong Bi-Designated Verifier Proxy Signature Schemes. 24 - Christian Robenhagen Ravnshøj:
Non-Cyclic Subgroups of Jacobians of Genus Two Curves with Complex Multiplication. 25 - Mitsuru Kawazoe, Tetsuya Takahashi:
Pairing-friendly Hyperelliptic Curves with Ordinary Jacobians of Type y2=x5+ax. 26 - Girraj Kumar Verma:
Blind Signature Scheme over Braid Groups. 27 - Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin:
HB#: Increasing the Security and Efficiency of HB+. 28 - Christian Robenhagen Ravnshøj:
Non-Cyclic Subgroups of Jacobians of Genus Two Curves. 29 - Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs:
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. 30 - Dalia Khader:
Authenticating with Attributes. 31 - Boaz Barak, Mohammad Mahmoody-Ghidary:
Merkle Puzzles are Optimal. 32 - Boaz Barak, Mohammad Mahmoody-Ghidary:
Lower Bounds on Signatures From Symmetric Primitives. 33 - Chunming Tang, Dingyi Pei, Zhuojun Liu, Zheng-an Yao, Mingsheng Wang:
Perfectly Hiding Commitment Scheme with Two-Round from Any One-Way Permutation. 34 - Yehuda Lindell:
Efficient Fully-Simulatable Oblivious Transfer. 35 - Jacques Patarin:
Generic Attacks on Feistel Schemes. 36 - Georg Fuchsbauer, David Pointcheval:
Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures. 37 - Hassan M. Elkamchouchi, Yasmine Abouelseoud:
A New Blind Identity-Based Signature Scheme with Message Recovery. 38 - Shuhong Wang, Reihaneh Safavi-Naini:
New Results on Unconditionally Secure Multireceiver Manual Authentication. 39 - Eunjeong Lee, Hyang-Sook Lee, Cheol-Min Park:
Efficient and Generalized Pairing Computation on Abelian Varieties. 40 - Hassan M. Elkamchouchi, Yasmine Abouelseoud:
A New Proxy Identity-Based Signcryption Scheme for Partial Delegation of Signing Rights. 41 - Julien Bringer, Hervé Chabanne:
Trusted-HB: a low-cost version of HB+ secure against Man-in-The-Middle attacks. 42 - Nasour Bagheri, Majid Naderi, Babak Sadeghiyan:
Cryptanalysis of CRUSH hash structure. 43 - Ari Juels, Ravikanth Pappu, Bryan Parno:
Unidirectional Key Distribution Across Time and Space with Applications to RFID Security. 44 - Rosario Gennaro, Shai Halevi, Hugo Krawczyk, Tal Rabin:
Threshold RSA for Dynamic and Ad-Hoc Groups. 45 - Tal Moran, Gil Segev:
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. 46 - Vicente Benjumea, Seung Geol Choi, Javier López, Moti Yung:
Fair Traceable Multi-Group Signatures. 47 - Donghoon Chang, Jaechul Sung, Seokhie Hong, Sangjin Lee:
Improved Cryptanalysis of APOP-MD4 and NMAC-MD4 using New Differential Paths. 48 - Yehuda Lindell, Benny Pinkas:
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. 49 - Sunder Lal, Prashant Kushwah:
Multi-PKG ID based signcryption. 50 - Patrick Longa, Ali Miri:
New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields (full version). 51 - Patrick Longa, Ali Miri:
New Multibase Non-Adjacent Form Scalar Multiplication and its Application to Elliptic Curve Cryptosystems (extended version). 52 - Miroslava Sotáková:
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model. 53 - Jin Hong, Kyung Chul Jeong, Eun Young Kwon, In-Sok Lee, Daegun Ma:
Variants of the Distinguished Point Method for Cryptanalytic Time Memory Trade-offs (Full version). 54 - (Withdrawn) cryptanalysis and Improvement of a Recently Proposed Remote User Authentication Scheme Using Smart Cards. 55
- Vladyslav Kovtun, Thomas J. Wollinger:
Fast explicit formulae for genus 2 hyperelliptic curves using projective coordinates (Updated). 56 - Vladyslav Kovtun, Jan Pelzl, Alexandr Kuznetsov:
Software Implementation of Genus-2 Hyperelliptic Curve Cryptosystems Over Prime Fields. 57 - Thomas Eisenbarth, Timo Kasper, Amir Moradi, Christof Paar, Mahmoud Salmasizadeh, Mohammad T. Manzuri Shalmani:
Physical Cryptanalysis of KeeLoq Code Hopping Applications. 58 - Stefan Popoveniuc, Jonathan Stanton:
Buying random votes is as hard as buying no-votes. 59 - Nicholas T. Sullivan:
Fast Algorithms for Arithmetic on Elliptic Curves Over Prime Fields. 60 - David Mandell Freeman, Peter Stevenhagen, Marco Streng:
Abelian varieties with prescribed embedding degree. 61 - Juliana Belding, Reinier Bröker, Andreas Enge, Kristin E. Lauter:
Computing Hilbert Class Polynomials. 62 - Gregory Neven:
Efficient Sequential Aggregate Signed Data. 63 - Pavol Zajac:
Remarks on the NFS complexity. 64 - Junghyun Nam:
Infringing and Improving Password Security of a Three-Party Key Exchange Protocol. 65 - Junjie Jiang, Jing Chen, Jian Wang, Duncan S. Wong, Xiaotie Deng:
High Performance Architecture for Elliptic Curve Scalar Multiplication over GF(2m). 66 - David Cash, Eike Kiltz, Victor Shoup:
The Twin Diffie-Hellman Problem and Applications. 67 - Peter Bogetoft, Dan Lund Christensen, Ivan Damgård, Martin Geisler, Thomas P. Jakobsen, Mikkel Krøigaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael I. Schwartzbach, Tomas Toft:
Multiparty Computation Goes Live. 68 - Marius Oliver Gheorghita:
HENKOS Cryptanalysis-Related keys attack. 69 - Christian Robenhagen Ravnshøj:
Generators of Jacobians of Genus Two Curves. 70 - Martijn Stam:
Blockcipher Based Hashing Revisited. 71 - Alexandre M. Deusajute, Paulo S. L. M. Barreto:
The SIP Security Enhanced by Using Pairing-assisted Massey-Omura Signcryption. 72 - Hovav Shacham, Brent Waters:
Compact Proofs of Retrievability. 73 - Bae Eun Jung, Hee Jean Kim:
On the Chikazawa-Inoue ID based key system. 74 - Jonathan J. Hoch, Adi Shamir:
On the Strength of the Concatenated Hash Combiner when All the Hash Functions are Weak. 75 - Kashif Ali, Howard M. Heys:
Results from a Search for the Best Linear Approximation of a Block Cipher. 76 - Shigeo Tsujii, Kohtaro Tadaki, Ryou Fujita:
Nonlinear Piece In Hand Matrix Method for Enhancing Security of Multivariate Public Key Cryptosystems. 77 - Donghoon Chang, Mridul Nandi:
A Short Proof of the PRP/PRF Switching Lemma. 78 - Manoj Prabhakaran, Mike Rosulek:
Homomorphic Encryption with CCA Security. 79 - Aniket Kate, Gregory M. Zaverucha, Ian Goldberg:
Pairing-Based Onion Routing with Improved Forward Secrecy. 80 - Marcel Medwed, Elisabeth Oswald:
Template Attacks on ECDSA. 81 - Roberto Araújo, Peter Y. A. Ryan:
Improving the Farnel, Threeballot, and Randell-Ryan Voting Schemes. 82 - Hung-Min Sun, Wei-Chih Ting, King-Hang Wang:
On the Security of Chien's Ultralightweight RFID Authentication Protocol. 83 - Sunder Lal, Prashant Kushwah:
ID based generalized signcryption. 84 - Changan Zhao, Fangguo Zhang, Jiwu Huang:
All Pairings Are in a Group. 85 - Arpita Patra, Ashish Choudhary, Madhu Gayatri, C. Pandu Rangan:
Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary. 86 - Amir Herzberg, Haya Schulmann, Amitabh Saxena, Bruno Crispo:
Towards a Theory of White-Box Security. 87 - Mahabir Prasad Jhanwar, Rana Barua:
A Public Key Encryption In Standard Model Using Cramer-Shoup Paradigm. 88 - Søren S. Thomsen:
An improved preimage attack on MD2. 89 - Mridul Nandi:
Improving upon HCTR and matching attacks for Hash-Counter-Hash approach. 90 - Mridul Nandi:
A Generic Method to Extend Message Space of a Strong Pseudorandom Permutation. 91 - Mridul Nandi:
An Efficient SPRP-secure Construction based on Pseudo Random Involution. 92 - Girraj Kumar Verma:
New ID-based Fair Blind Signatures. 93 - Kaoru Kurosawa, Jun Furukawa:
Universally Composable Undeniable Signature. 94 - Chifumi Sato, Takeshi Okamoto, Eiji Okamoto:
Strongly Unforgeable ID-based Signatures Without Random Oracles. 95 - Frederik Vercauteren:
Optimal Pairings. 96 - Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan:
Fairness with an Honest Minority and a Rational Majority. 97 - Xu An Wang, Xiaoyuan Yang, Yiliang Han:
On Security Notions for Verifiable Encrypted Signature. 98 - Kristin E. Lauter, Katherine E. Stange:
The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences. 99 - Patrick Longa:
Accelerating the Scalar Multiplication on Elliptic Curve Cryptosystems over Prime Fields. 100 - (Withdrawn) Probabilistic Verifiable Secret Sharing Tolerating Adaptive Adversary. 101
- Shai Halevi, Tal Rabin:
Degradation and Amplification of Computational Hardness. 102 - (Withdrawn) Identity-Based Proxy Re-encryption Schemes with Multiuse, Unidirection, and CCA Security. 103
- Ernie Brickell, Liqun Chen, Jiangtao Li:
Simplified Security Notions of Direct Anonymous Attestation and a Concrete Scheme from Pairings. 104 - Wil Michiels, Paul Gorissen, Henk D. L. Hollmann:
Cryptanalysis of White-Box Implementations. 105 - Laurent Evain:
Knapsack cryptosystems built on NP-hard instances. 106 - Helger Lipmaa:
Private Branching Programs: On Communication-Efficient Cryptocomputing. 107 - Jintai Ding, Bo-Yin Yang, Chia-Hsin Owen Chen, Ming-Shing Chen, Chen-Mou Cheng:
New Differential-Algebraic Attacks and Reparametrization of Rainbow. 108 - Florian Mendel, Martin Schläffer:
Collisions for Round-Reduced LAKE. 109 - (Withdrawn) On the Design of Secure and Fast Double Block Length Hash Functions. 110
- Yuriy I. Izbenko, Vladyslav Kovtun, Alexandr Kuznetsov:
The Design of Boolean Functions by Modified Hill Climbing Method. 111 - Dong Zheng, Xiangxue Li, Changshe Ma, Kefei Chen, Jianhua Li:
Democratic Group Signatures with Threshold Traceability. 112 - Daniel Mall, Qing Zhong:
Open Source Is Not Enough. Attacking the EC-package of Bouncycastle version 1.x_132. 113 - Giuseppe Ateniese, Roberto Di Pietro, Luigi V. Mancini, Gene Tsudik:
Scalable and Efficient Provable Data Possession. 114 - Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Francisco Rodríguez-Henríquez:
A Comparison Between Hardware Accelerators for the Modified Tate Pairing over F2m and F3m. 115 - Alon Rosen, Gil Segev:
Chosen-Ciphertext Security via Correlated Products. 116 - Steven D. Galbraith, Michael Scott:
Exponentiation in pairing-friendly groups using homomorphisms. 117 - Patrick Longa, Catherine H. Gebotys:
Setting Speed Records with the (Fractional) Multibase Non-Adjacent Form Method for Efficient Elliptic Curve Scalar Multiplication. 118 - Benoît Chevallier-Mames, David Naccache, Jacques Stern:
Linear Bandwidth Naccache-Stern Encryption. 119 - Denis Osin, Vladimir Shpilrain:
Public key encryption and encryption emulation attacks. 120 - Mark Wooding:
New proofs for old modes. 121 - Seog Chung Seo, Dong-Guk Han, Seokhie Hong:
TinyECCK: Efficient Elliptic Curve Cryptography Implementation over GF(2m) on 8-bit MICAz Mote. 122 - Mehrdad Khatir, Amir Moradi:
Secure Adiabatic Logic: a Low-Energy DPA-Resistant Logic Style. 123 - Daniel Loebenberger:
A Simple Derivation for the Frobenius Pseudoprime Test. 124 - Florian Hess:
Pairing Lattices. 125 - Philippe Golle:
Machine Learning Attacks Against the ASIRRA CAPTCHA. 126 - Nidia Cortez-Duarte, Francisco Rodríguez-Henríquez, Jean-Luc Beuchat, Eiji Okamoto:
A Pipelined Karatsuba-Ofman Multiplier over GF(397) Amenable for Pairing Computation. 127 - Hidehiko Nakagami, Ryoichi Teramura, Toshihiro Ohigashi, Hidenori Kuwakado, Masakatu Morii:
A Chosen IV Attack Using Phase Shifting Equivalent Keys against DECIM v2. 128 - Mohamed Layouni:
Controlling access to personal data through Accredited Symmetrically Private Information Retrieval. 129 - Florian Mendel, Norbert Pramstaller, Christian Rechberger, Vincent Rijmen:
Analysis of Step-Reduced SHA-256. 130 - Sebastiaan Indesteege, Florian Mendel, Bart Preneel, Christian Rechberger:
Collisions and other Non-Random Properties for Step-Reduced SHA-256. 131 - Juan A. Garay, Aggelos Kiayias, Hong-Sheng Zhou:
A Framework for the Sound Specification of Cryptographic Tasks. 132 - Pierrick Gaudry, David Lubicz:
The arithmetic of characteristic 2 Kummer surfaces. 133 - Alon Rosen, Gil Segev:
Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption. 134 - Clemens Heuberger, James A. Muir:
Unbalanced Digit Sets and the Closest Choice Strategy for Minimal Weight Integer Representations. 135 - Man Ho Au, Willy Susilo, Yi Mu:
Constant-Size Dynamic k-TAA. 136 - Gaetan Bisson, Takakazu Satoh:
More Discriminants with the Brezing-Weng Method. 137