Volume 2000, 2000

• 
  Oded Goldreich: On Security Preserving Reductions - Revised Terminology. 1
• 
  Michel Abdalla, Leonid Reyzin: A New Forward-Secure Digital Signature Scheme. 2
• 
  Marc Fischlin: Implications of the Nontriviality of Entropy Approximation. 3
• 
  Jessica Staddon, Douglas R. Stinson, Ruizhong Wei: Combinatorial Properties of Frameproof and Traceability Codes. 4
• 
  Yuriy Tarannikov: On Resilient Boolean Functions with Maximal Possible Nonlinearity. 5
• 
  Tak-Ming Law: An Encryption Algorithm and Key-stream Generator for Chinese Text Messages by Character Internal Code Structure. 6
• 
  Tak-Ming Law: Public Electronic Contract Protocol. 7
• 
  Ivan Damgård, Mads Jurik: Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes. 8
• 
  Palash Sarkar, Subhamoy Maitra: New Directions in Design of Resilient Boolean Functions. 9
• 
  Mihir Bellare, Alexandra Boldyreva: The Security of Chaffing and Winnowing. 10
• 
  Gideon Samid: Tailored Key Encryption (TaKE) Tailoring a key for a given pair of plaintext/ciphertext. 11
• 
  DaeHun Nyang, JooSeok Song: Chosen Message Attack Against Goldreich-Goldwasser-Halevi's Signature Scheme from Crypto'97. 12
• 
  Joe Kilian, Erez Petrank: Concurrent Zero-Knowledge in Poly-logarithmic Rounds. 13
• 
  Mihir Bellare, David Pointcheval, Phillip Rogaway: Authenticated Key Exchange Secure Against Dictionary Attacks. 14
• 
  Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali: Identification Protocols Secure Against Reset Attacks. 15
• 
  Benne de Weger: Cryptanalysis of RSA with small prime difference. 16
• 
  Rosario Gennaro, Luca Trevisan: Lower Bounds on the Efficiency of Generic Cryptographic Constructions. 17
• 
  Anna Lysyanskaya: Threshold Cryptography Secure Against the Adaptive Adversary, Concurrently. 19
• 
  Maria Isabel Gonzalez Vasco, Igor Shparlinski: On the Security of Diffie-Hellman Bits. 20
• 
  Shahrokh Saeednia: An Efficient Identification Scheme Based on Permuted Patterns. 21
• 
  Thomas Schweinberger, Victor Shoup: ACE: The Advanced Cryptographic Engine. 22
• 
  Igor Shparlinski: Security of Polynomial Transformations of the Diffie-Hellman Key. 23
• 
  Maria Isabel Gonzalez Vasco, Igor E. Shparlinski: Security of the Most Significant Bits of the Shamir Message Passing Scheme. 24
• 
  Mihir Bellare, Chanathip Namprempre: Authenticated Encryption: Relations among notions and analysis of the generic composition paradigm. 25
• 
  Taekyoung Kwon: Authentication and Key Agreement via Memorable Password. 26
• 
  Ahto Buldas, Peeter Laud, Helger Lipmaa: Accountable Certificate Management using Undeniable Attestations. 27
• 
  Christian Cachin: An Information-Theoretic Model for Steganography. 28
• 
  Anand Desai, Sara K. Miner: Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications. 29
• 
  Joan Feigenbaum, Jessica H. Fong, Martin Strauss, Rebecca N. Wright: Secure Multiparty Computation of Approximations. 30
• 
  Michel Abdalla, Sara K. Miner, Chanathip Namprempre: Forward Security in Threshold Signature Schemes. 31
• 
  Birgit Pfitzmann, Ahmad-Reza Sadeghi: Anonymous Fingerprinting with Direct Non-Repudiation. 32
• 
  Kazumaro Aoki: The Complete Distribution of Linear Probabilities of MARS' s-box. 33
• 
  Christian Cachin, Klaus Kursawe, Victor Shoup: Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography. 34
• 
  Alejandro Hevia, Marcos A. Kiwi: Electronic Jury Voting Protocols. 35
• 
  Jean-Pierre Seifert: Using fewer Qubits in Shor's Factorization Algorithm via Simultaneous Diophantine Approximation. 36
• 
  Ronald Cramer, Ivan Damgård, Ueli Maurer: General Secure Multi-Party Computation from any Linear Secret Sharing Scheme. 37
• 
  Ronald Cramer, Ivan Damgård, Stefan Dziembowski: On the Complexity of Verifiable Secret Sharing and Multi-Party Computation. 38
• 
  Charanjit S. Jutla: Encryption Modes with Almost Free Message Integrity. 39
• 
  Eric Filiol: Decimation Attack of Stream Ciphers. 40
• 
  Sanjeev Kumar Mishra: On Symmetrically Private Information Retrieval. 41
• 
  Moni Naor, Omer Reingold: Constructing Pseudo-Random Permutations with a Prescribed Structure. 42
• 
  Carlo Blundo, Barbara Masucci, Douglas R. Stinson, Ruizhong Wei: Constructions and Bounds for Unconditionally Secure Commitment Schemes. 43
• 
  Victor Boyko, Philip D. MacKenzie, Sarvar Patel: Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman. 44
• 
  Ronald Cramer, Ivan Damgård, Philip D. MacKenzie: Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. 45
• 
  Stefan Lucks: The Saturation Attack - a Bait for Twofish. 46
• 
  Subhamoy Maitra: Highly Nonlinear Balanced Boolean Functions with very good Autocorrelation Property. 47
• 
  Enes Pasalic, Thomas Johansson, Subhamoy Maitra, Palash Sarkar: New Constructions of Resilent and Correlation Immune Boolean Functions achieving Upper Bounds on Nonlinearity. 48
• 
  Palash Sarkar: Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions. 49
• 
  Yuriy Tarannikov, Denis Kirienko: Spectral Analysis of High Order Correlation Immune Functions. 50
• 
  Matthew Kwan: Reducing the Gate Count of Bitslice DES. 51
• 
  Slobodan Petrovic, Amparo Fúster-Sabater: CRYPTANALYSIS OF THE A5/2 ALGORITHM. 52
• 
  Thomas Johansson, Enes Pasalic: A Construction of Resilient Functions with High Nonlinearity. 53
• 
  Subhamoy Maitra: Correlation Immune Boolean Functions with Very High Nonlinearity. 54
• 
  Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen: Multiparty Computation from Threshold Homomorphic Encryption. 55
• 
  Amit Sahai, Salil P. Vadhan: A Complete Problem for Statistical Zero Knowledge. 56
• 
  Oded Goldreich, Yehuda Lindell: Session-Key Generation using Human Passwords Only. 57
• 
  Sara K. Miner, Jessica Staddon: Graph-Based Authentication of Digital Streams. 58
• 
  Gideon Samid: Essential Shannon Security with Keys Smaller Than the Encrypted Message. 59
• 
  Victor Shoup: OAEP Reconsidered. 60
• 
  Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, Jacques Stern: RSA-OAEP is Secure under the RSA Assumption. 61
• 
  Gideon Samid: Non-Deforming Digital Watermarks. 62
• 
  Oded Goldreich: Candidate One-Way Functions Based on Expander Graphs. 63
• 
  Oded Goldreich, Vered Rosen: On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators. 64
• 
  Masashi Mitomo, Kaoru Kurosawa: How to Encrypt Long Messages without Large Size Symmetric/Asymmetric Encryption Schemes. 65
• 
  Birgit Pfitzmann, Michael Waidner: A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. 66
• 
  Ran Canetti: Universally Composable Security: A New Paradigm for Cryptographic Protocols. 67
• 
  Tak-Ming Law: A Content Certified E-mail Protocol with a Public Mailbox. 68
• 
  Yuriy Tarannikov: New constructions of resilient Boolean functions with maximal nonlinearity. 69

last updated on Thu May 23 04:13:38 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page