Ueli Maurer  Home/Search
Context
Related
| inf.ethz.ch/pub/crypto/p...Maurer00b.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: crypto.ethz.ch/~ma...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Cryptography is both a fascinating mathematical science and a key technology for the emerging information society, with theory and applications being closely related. This article reviews some highlights of the past ten years of research in cryptography and its applications and discusses some of the main challenges for future research. A major future research theme is to weaken the assumptions on which security proofs are based, in particular computational intractability assumptions, trust ... (Update)
Active bibliography (related documents): More All
0.5: Masking the Energy Behavior of Encryption Algorithms - Saputra, Vijaykrishnan.. (Correct)
0.5: Adaptively-Secure, Non-Interactive Public-Key Encryption - Canetti, Halevi, Katz (2004) (Correct)
0.5: The Art of Signaling: Fifty Years of Coding Theory - Calderbank (1998) (Correct)
Similar documents based on text: More All
0.3: Secure Multi-Party Computation Made Simple - Ueli Maurer Department (Correct)
0.3: Intrinsic Limitations of Digital Signatures and - How To Cope (Correct)
0.2: Tight Security Proofs for the Bounded-Storage Model - Stefan Dziembowski Dziembowski (2002) (Correct)
BibTeX entry: (Update)
@misc{ maurer-cryptography,
author = "Ueli Maurer",
title = "Cryptography 2000 ± 10",
url = "citeseer.ist.psu.edu/462891.html" }
Citations (may not include all citations):1529 A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978
1447 A mathematical theory of communication (context) - Shannon - 1948
1065 Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1997
704 Applied Cryptography (context) - Schneier - 1996
659 Random oracles are practical: A paradigm for designing effic.. - Bellare, Rogaway - 1993
531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988
428 IEEE Transactions on Information Theory (context) - Diffie, Hellman et al. - 1976
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
411 How to prove yourself: practical solution to identification .. - Fiat, Shamir - 1987
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali et al. - 1984
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
288 Linear Cryptanalysis Method for DES Cipher (context) - Matsui - 1994
287 Multiparty unconditionally secure protocols (context) - Chaum, Cr'epeau et al. - 1988
254 A practical public-key cryptosystem provably secure against .. - Cramer, Shoup - 1998
241 Communication theory of secrecy systems (context) - Shannon - 1949
239 Cryptography -- Theory and Practice (context) - Stinson - 1995
219 Completeness theorems for non-cryptographic fault-tolerant d.. (context) - Ben-Or, Goldwasser et al. - 1988
203 Approximating clique is almost NP-complete (context) - Feige, Goldwasser et al. - 1991
196 Minimum disclosure proofs of knowledge (context) - Brassard, Chaum et al. - 1988
173 How to construct pseudorandom permutations from pseudorandom.. (context) - Luby, Rackoff - 1988
170 Elliptic curve public key cryptosystems (context) - Menezes - 1993
167 Pseudo-random generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
161 Differential cryptanalysis of the Data Encryption Standard (context) - Biham, Shamir - 1993
134 Reducing elliptic curve logarithms to logarithms in a finite.. (context) - Menezes, Okamoto et al. - 1991
134 Factoring integers with elliptic curves (context) - Lenstra - 1987
124 Lower bounds for discrete logarithms and related problems - Shoup - 1997
119 Chosen ciphertext attacks against protocols based on the RSA.. - Bleichenbacher - 1998
114 Noninteractive zero-knowledge proof of knowledge and chosen .. (context) - Rackoff, Simon - 1991
111 The Official PGP User's Guide (context) - Zimmermann - 1995
103 A proposal for a new block encryption standard - Lai, Massey - 1991
98 How to play any mental game -- a completeness theorem for pr.. (context) - Goldreich, Micali et al. - 1987
97 The security of the cipher block chaining message authentica.. - Bellare, Kilian et al. - 1995
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996
84 Generating hard instances of lattice problems (context) - Ajtai - 1996
68 Low-exponent RSA with related messages - Coppersmith, Franklin et al. - 1996
68 Secret key agreement by public discussion from common inform.. - Maurer - 1993
67 Experimental quantum cryptography - Bennett, Bessette et al. - 1992
66 Timing attacks on implementations of Diffie-Hellman (context) - Kocher - 1996
63 A public-key cryptosystem based on algebraic coding theory (context) - McEliece - 1978
62 RSA and Rabin functions: certain parts are as hard as the wh.. (context) - Alexi, Chor et al. - 1988
57 Algorithms for quantum computation: discrete log and factori.. - Shor - 1994
55 Hardness of computing the most significant bits of secret ke.. (context) - Boneh, Venkatesan - 1996
55 Efficient generation of shared RSA keys - Boneh, Franklin - 1997
45 Secure communication over insecure channels (context) - Merkle - 1978
42 public key cryptosystem with worst caseaverage case equivale.. - Dwork, cryptosystem et al. - 1997
42 Public-key cryptosystems from lattice reduction problems - Goldreich, Goldwasser et al. - 1997
40 Player simulation and general adversary structures in perfec.. - Hirt, Maurer - 2000
39 Efficient signature generation for smart cards (context) - Schnorr - 1991
35 two new families of asymmetric algorithms (context) - Patarin, equations et al. - 1996
35 The discrete logarithm problem (context) - McCurley - 1990
31 A secure and optimally efficient multi-authority election sc.. - Cramer, Gennaro et al. - 1997
24 Advances in Cryptology - CRYPTO (context) - Kocher, Jaffe et al. - 1999
23 Algebraic Aspects of Cryptography (context) - Koblitz - 1998
23 Advances in Cryptology -- CRYPTO (context) - Chaum, van Antwerpen et al. - 1990
23 Advances in Cryptology --- CRYPTO (context) - Chaum, systems - 1984
19 Advances in Cryptology --- EUROCRYPT (context) - Chaum, van Heyst et al. - 1991
18 th IEEE Symposium on the Foundations of Computer Science (context) - Hastad, Naslund et al. - 1998
18 Cryptanalysis of the Ajtai-Dwork cryptosystem - Nguyen, Stern - 1998
16 NTRU: A ring based public key cryptosystem - Hoffstein, Pipher et al. - 1998
16 rd IEEE Symposium on the Foundations of Computer Science (context) - Yao, secure et al. - 1982
14 The security of the birational permutation signature schemes - Coppersmith, Stern et al. - 1997
13 Cascade ciphers: the importance of being first - Massey, Maurer - 1993
13 Electronic cash systems based on the representation problem .. (context) - Brands - 1994
13 Cryptanalysis of the Chor-Rivest cryptosystem (context) - Vaudenay - 1998
12 Fast correlation attacks on stream ciphers (context) - Meier, Staffelbach - 1989
12 Cryptanalysis of the HFE public key cryptosystem by relinear.. (context) - Kipnis, Shamir - 1999
11 Advances in Cryptology -- CRYPTO (context) - Merkle, digital - 1990
10 Journal of Cryptology (context) - Dobbertin, MD - 1998
10 Efficient receipt-free voting based on homomorphic encryptio.. - Hirt, Sako
8 Fail-stop signatures and their application - Pfitzmann, Waidner - 1991
8 A boolean function requiring 3n network size (context) - Blum - 1984
7 Efficient signature schemes based on birational permutations - Shamir - 1994
6 Probabilistically checkable proofs and their consequences fo.. - Hougardy, Promel et al. - 1995
5 Advances in Cryptology - EUROCRYPT (context) - Shoup, signatures
5 the complexity of breaking the Diffie-Hellman protocol - Maurer, Wolf - 1999
4 and J.M. Pollard, The number field sieve, Proc. 22nd ACM Sym.. (context) - Lenstra, Lenstra et al. - 1990
3 Fourth Estate (context) - Singh, Book - 1999
3 Efficient secure multi-party computation - Hirt, Maurer et al.
3 How to prove all NP statements in zero-knowledge (context) - Goldreich, Micali et al. - 1987
2 th ACM Symposium on the Theory of Computing (context) - Canetti, Goldreich et al. - 1998
2 the story of secret writing (context) - Kahn, breakers - 1967
2 Advances in Cryptology - EUROCRYPT (context) - Cavallar, of et al.
2 The Rijndael block cipher -- AES Proposal (context) - Daemen, Rijmen
1 rd ACM Symposium on the Theory of Computing (context) - Dolev, Dwork et al. - 1991
1 st Annual Symposium on Foundations of Computer Science (context) - Shamir, PSPACE - 1990
1 Chapter 13 in Handbook of Theoretical Computer Science (context) - Rivest - 1990
1 Constructions of feebly-one-way families of permutations (context) - Hiltgen - 1993
Documents on the same site (http://www.crypto.ethz.ch/~maurer/publications.html): More
Perfect Cryptographic Security from Partially Independent Channels - Maurer (1991) (Correct)
Robustness for Free in Unconditional Multi-Party Computation - Hirt, Maurer (2001) (Correct)
Information-Theoretic Cryptography (Extended Abstract) - Maurer (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC