Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIACR Cryptology ePrint Archive, Volume 2001
Volume 2001, 2001
- Helger Lipmaa, Shiho Moriai:
Efficient Algorithms for Computing Differential Properties of Addition. 1 - Mihir Bellare, Chanathip Namprempre, David Pointcheval, Michael Semanko:
The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme. 2 - Antoine Joux, Kim Nguyen:
Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. 3 - (Withdrawn) MinRank problem and Zero-knowledge authentication. 4
- Ilya Mironov:
A Note on Cryptanalysis of the Preliminary Version of the NTRU Signature Scheme. 5 - Christian Cachin, Klaus Kursawe, Frank Petzold, Victor Shoup:
Secure and Efficient Asynchronous Broadcast Protocols. 6 - Ronald L. Rivest, Robert Silverman:
Are 'Strong' Primes Needed for RSA. 7 - Pierre-Alain Fouque, Jacques Stern:
Fully Distributed Threshold RSA under Standard Assumptions. 8 - Wen-Guey Tzeng, Zhi-Jia Tzeng:
Robust key-evolving public key encryption schemes. 9 - Nicolas T. Courtois, Matthieu Finiasz, Nicolas Sendrier:
How to achieve a McEliece-based Digital Signature Scheme. 10 - Wenbo Mao:
New Zero-knowledge Undeniable Signatures - Forgery of Signature Equivalent to Factorisation. 11 - John Black, Phillip Rogaway:
Ciphers with Arbitrary Finite Domains. 12 - Anna M. Johnston:
Digitally Watermarking RSA Moduli. 13 - Wenbo Mao:
Timed-Release Cryptography. 14 - Shai Halevi:
An observation regarding Jutla's modes of operation. 15 - Alice Silverberg, Jessica Staddon, Judy L. Walker:
Efficient Traitor Tracing Algorithms using List Decoding. 16 - Ran Canetti, Ivan Damgård, Stefan Dziembowski
, Yuval Ishai, Tal Malkin:
On adaptive vs. non-adaptive security of multiparty protocols. 17 - Peter Gemmell, Anna M. Johnston:
Analysis of a Subset Sum Randomizer. 18 - Jan Camenisch, Anna Lysyanskaya:
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. 19 - Douglas R. Stinson:
Some observations on the theory of cryptographic hash functions. 20 - Eli Biham, Orr Dunkelman, Nathan Keller:
The Rectangle Attack - Rectangling the Serpent. 21 - Klaus Kursawe, Victor Shoup:
Optimistic Asynchronous Atomic Broadcast. 22 - Martin Hirt, Ueli Maurer:
Robustness for Free in Unconditional Multi-Party Computation. 23 - Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright:
Secure Multiparty Computation of Approximations. 24 - (Withdrawn) Cryptanalysis of some elliptic curve based cryptosystems of Paillier. 25
- Phillip Rogaway, Mihir Bellare, John Black, Ted Krovetz:
OCB Mode. 26 - John Black, Phillip Rogaway:
A Block-Cipher Mode of Operation for Parallelizable Message Authentication. 27 - Alexander Russell, Hong Wang:
Efficient Encryption for Rich Message Spaces Under General Assumptions. 28 - Nicolas T. Courtois:
On multivariate signature-only public key cryptosystems. 29 - Amos Beimel, Yuval Ishai:
On the Power of Nonlinear Secret-Sharing. 30 - Jonathan Katz, Rafail Ostrovsky, Moti Yung:
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. 31 - Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam D. Smith:
Efficient and Non-Interactive Non-Malleable Commitment. 32 - Liam Keliher, Henk Meijer, Stafford E. Tavares:
Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. 33 - Tal Malkin, Daniele Micciancio, Sara Miner More:
Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures. 34 - Mihir Bellare, Bennet S. Yee:
Forward-Security in Private-Key Cryptography. 35 - Moni Naor, Vanessa Teague:
Anti-persistence: History Independent Data Structures. 36 - Josyula R. Rao, Pankaj Rohatgi:
EMpowering Side-Channel Attacks. 37 - Louis Granboulan:
Flaws in differential cryptanalysis of Skipjack. 38 - Taekyoung Kwon:
Robust Software Tokens: Towards Securing a Digital Identity. 39 - Ran Canetti, Hugo Krawczyk:
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. 40 - Michael J. Jacobson Jr., Alfred Menezes, Andreas Stein:
Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent. 41 - Hugo Krawczyk:
Simple Forward-Secure Signatures From Any Signature Scheme. 42 - Marina Pudovkina:
Cryptanalysis of the Vesta-2M Stream Cipher. 43 - Birgit Baum-Waidner:
Optimistic Asynchronous Multi-Party Contract Signing with Reduced Number of Rounds. 44 - Hugo Krawczyk:
The order of encryption and authentication for protecting communications (Or: how secure is SSL?). 45 - Boris Ryabko:
The simple ideal cipher system. 46 - Tzuong-Tsieng Moh:
On the method of "XL" and its inefficiency to TTM. 47 - Gene Itkis, Leonid Reyzin:
Forward-Secure Signatures with Optimal Signing and Verifying. 48 - Marina Pudovkina:
A known plaintext attack on the ISAAC keystream generator. 49 - Steven D. Galbraith:
Elliptic curve Paillier schemes. 50 - Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen:
Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds. 51 - Alexis Warner Machado:
Differential Probability of Modular Addition with a Constant Operand. 52 - Jakob Jonsson:
Security Proofs for the RSA-PSS Signature Scheme and Its Variants. 53 - Steven D. Galbraith, Florian Hess, Nigel P. Smart:
Extending the GHS Weil Descent Attack. 54 - Ran Canetti, Marc Fischlin:
Universally Composable Commitments. 55 - Pascal Junod:
On the Complexity of Matsui's Attack. 56 - Philip MacKenzie:
On the Security of the SPEKE Password-Authenticated Key Exchange Protocol. 57 - Nicolas T. Courtois:
Efficient Zero-knowledge Authentication Based on a Linear Algebra Problem MinRank. 58 - Dalit Naor, Moni Naor, Jeffrey B. Lotspiech:
Revocation and Tracing Schemes for Stateless Receivers. 59 - Mihir Bellare, Ravi S. Sandhu:
The Security of Practical Two-Party RSA Signature Schemes. 60 - Alexander Kholosha:
Clock-Controlled Shift Registers for Key-Stream Generation. 61 - Jean-Sébastien Coron:
Optimal security proofs for PSS and other signature schemes. 62 - Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell:
Resettably-Sound Zero-Knowledge and its Applications. 63 - Ivan Damgård, Eiichiro Fujisaki:
An Integer Commitment Scheme based on Groups with Hidden Order. 64 - Marina Pudovkina:
Analysis of chosen plaintext attacks on the WAKE Stream Cipher. 65 - Seong-Hun Paeng, Daesung Kwon, Kil-Chan Ha, Jae Heon Kim:
Improved Public Key Cryptosystem using Finite non Abelian Groups. 66 - Jeff Jianxin Yan, Yongdong Wu:
An Attack on A Traitor Tracing Scheme. 67 - Jorge Nakahara Jr., Paulo S. L. M. Barreto, Bart Preneel, Joos Vandewalle, Hae Y. Kim:
SQUARE Attacks on Reduced-Round PES and IDEA Block Ciphers. 68 - Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
On the (Im)possibility of Obfuscating Programs. 69 - Kenji Ohkuma, Hideo Shimizu, Fumihiko Sano, Shin-ichi Kawamura:
Security Assessment of Hierocrypt and Rijndael against the Differential and Linear Cryptanalysis (Extended Abstract). 70 - Kaoru Kurosawa:
Multi-Recipient Public-Key Encryption with Shortened Ciphertext. 71 - Tzuong-Tsieng Moh, Jiun-Ming Chen:
On the Goubin-Courtois Attack on TTM. 72 - Wen-Guey Tzeng:
Efficient oblivious transfer schemes. 73 - Éliane Jaulmes, Antoine Joux, Frédéric Valette:
On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit - A New Construction. 74 - Moni Naor, Omer Reingold, Alon Rosen:
Pseudo-Random Functions and Factoring. 75 - Moni Naor, Kobbi Nissim:
Communication Complexity and Secure Function Evaluation. 76 - Markku-Juhani Olavi Saarinen:
A Time-Memory Tradeoff Attack Against LILI-128. 77 - Steve Babbage:
The COS Stream Ciphers are Extremely Weak. 78 - Jee Hea An:
Authenticated Encryption in the Public-Key Setting: Security Notions and Analyses. 79 - Eric Filiol, Caroline Fontaine:
COS Ciphers are not "extremely weak"! - The Design Rationale of COS Ciphers. 80 - Masao Mori:
A Sufficient Condition for Secure Ping-Pong Protocols. 81 - Ariel Glenn, Ian Goldberg, Frédéric Légaré, Anton Stiglic:
A Description of Protocols for Private Credentials. 82 - Maria Fedorova, Yuriy V. Tarannikov:
On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices. 83 - Markus Maurer, Alfred Menezes, Edlyn Teske:
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree. 84 - Ronald Cramer, Victor Shoup:
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. 85 - Helger Lipmaa:
Statistical Zero-Knowledge Proofs from Diophantine Equations. 86 - Carlo Blundo, Sebastià Martín Molleví, Barbara Masucci, Carles Padró:
A Linear Algebraic Approach to Metering Schemes. 87 - Ignacio Gracia, Sebastià Martín Molleví, Carles Padró:
Improving the trade-off between storage and communication in broadcast encryption schemes. 88 - Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo:
Linear broadcast encryption schemes. 89 - Dan Boneh, Matthew K. Franklin:
Identity Based Encryption From the Weil Pairing. 90 - Ivan Damgård, Jesper Buus Nielsen:
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. 91 - Matthias Krause:
BDD-based Cryptanalysis of Keystream Generators. 92 - Jonathan Katz, Moti Yung:
Threshold Cryptosystems Based on Factoring. 93 - M. A. Chateauneuf, Alan C. H. Ling, Douglas R. Stinson:
Slope packings and coverings, and generic algorithms for the discrete logarithm problem. 94 - Helger Lipmaa, N. Asokan, Valtteri Niemi:
Secure Vickrey Auctions without Threshold Trust. 95 - Amod Agashe, Kristin E. Lauter, Ramarathnam Venkatesan:
Constructing elliptic curves with a given number of points over a finite field. 96 - Sarvar Patel:
An Efficient MAC for Short Messages. 97 - Paulo S. L. M. Barreto, Hae Yong Kim:
Fast hashing onto elliptic curves over fields of characteristic 3. 98 - Kaoru Kurosawa, Takuya Yoshida:
Linear Code Implies Public-Key Traitor Tracing. 99 - Shahrokh Saeednia:
A Note on Girault's Self-Certified Model. 100 - Giuseppe Ateniese, Dawn Song, Gene Tsudik:
Quasi-Efficient Revocation of Group Signatures. 101 - Ivan Damgård, Gudmund Skovbjerg Frandsen:
An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates. 102 - Antonio Bellezza:
Countermeasures against Side-Channel Attacks for Elliptic Curve Cryptosystems. 103 - Oded Goldreich:
Concurrent Zero-Knowledge With Timing, Revisited. 104 - Boaz Barak, Oded Goldreich:
Universal Arguments and their Applications. 105 - Steve Babbage:
Cryptanalysis of the COS (2, 128) Stream Ciphers. 106 - Yehuda Lindell:
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. 107 - Ronald Cramer, Victor Shoup:
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack. 108 - Yunlei Zhao:
New Notions of Soundness and Simultaneous Resettability in the Public-Key Model. 109 - Louis Granboulan:
RSA hybrid encryption schemes. 110 - Nigel P. Smart:
An Identity Based Authenticated Key Agreement Protocol Based on the Weil Pairing. 111 - Victor Shoup:
A Proposal for an ISO Standard for Public Key Encryption. 112 - Jan Camenisch, Anna Lysyanskaya:
Efficient Revocation of Anonymous Group Membership. 113
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
