Shafi Goldwasser, Mihir Bellare  Home/Search
Context Related
| dim.uchile.cl/~mki...cryptonotes.ps.gz 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: dcc.uchile.cl/~ahev...index.shtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Contents 1 Introduction to Modern Cryptography 12 1.1 Encryption: Historical Glance : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 12 1.2 Modern Encryption: A Computational Complexity Based Theory : : : : : : : : : : : : : : : : 13 1.3 A Short List of Candidate One Way Functions : : : : : : : : : : : : : : : : : : : : : : : : : : 14 1.4 Security Definitions : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 15 1.5 The Model of Adversary ... (Update)
Cited by: More
Completeness of Formal Hashes in the - Standard Model Flavio (2006) (Correct)
Sound Computational Interpretation of - Symbolic Hashes In (Correct)
Completeness of Formal Hashes in the Standard Model - Garcia, van Rossum (Correct)
Active bibliography (related documents): More All
2.5: Cryptology - Rivest (1990) (Correct)
0.9: The Foundations of Modern Cryptography - Goldreich (1998) (Correct)
0.5: Theory and Practice of Verifiable Secret Sharing - Gennaro (1996) (Correct)
Similar documents based on text: More All
0.5: The Complexity of Decision versus Search - Bellare, Goldwasser (1994) (Correct)
0.5: Randomness in Interactive Proofs - Bellare, Goldreich, Goldwasser (1993) (Correct)
0.5: Identification Protocols Secure Against Reset Attacks - Bellare, Goldwasser, Micali (2000) (Correct)
Related documents from co-citation: More All
8: Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
7: Handbook of Applied Cryptography (context) - Menezes, Van Oorschot et al. - 1996
6: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols - Bellare, Rogaway - 1993
BibTeX entry: (Update)
S. Goldwasser and M. Bellare. Lecture notes on cryptography, June 1997. http://citeseer.ist.psu.edu/goldwasser96lecture.html More
@misc{ goldwasser99lecture,
author = "Shafi Goldwasser and Mihir Bellare",
title = "Lecture Notes on Cryptography",
howpublished = "Summer Course ``Cryptography and Computer Security'' at MIT, 1996--1999",
year = "1999",
url = "citeseer.ist.psu.edu/goldwasser96lecture.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1529 A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978
659 Random oracles are practical: A paradigm for designing effic.. - Bellare, Rogaway - 1994
635 New directions in cryptography - Diffie, Hellman - 1976
531 The knowledge complexity of interactive proof-systems (context) - Goldwasser, Micali et al. - 1985
531 The knowledge complexity of interactive proof-systems (context) - Goldwasser, Micali et al. - 1989
501 A digital signature scheme secure against adaptive chosenmes.. - Goldwasser, Micali et al. - 1988
450 Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1984
411 How to prove yourself: practical solutions to identification.. - Fiat, Shamir - 1987
401 The MD5 message-digest algorithm (context) - Rivest - 1992
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
329 Untraceable electronic mail (context) - Chaum - 1981
326 Non-malleable cryptography - Dolev, Dwork et al. - 1991
287 Multiparty unconditionally secure protocols (context) - Chaum, Cr'epeau et al. - 1988
278 Probabilistic encryption (context) - Goldwasser, Micali - 1984
255 Untraceable electronic cash (context) - Chaum, Fiat et al. - 1988
246 The exact security of digital signatures: How to sign with R.. - Bellare, Rogaway - 1996
227 Factoring polynomials with rational coefficients (context) - Lenstra, Lenstra et al. - 1982
208 Universal one-way hash functions and their cryptographic app.. - Naor, Yung - 1989
197 A randomized protocol for signing contracts (context) - Even, Goldreich et al. - 1985
189 Keying hash functions for message authentication - Bellare, Canetti et al. - 1996
188 Entity authentication and key distribution (context) - Bellare, Rogaway - 1994
186 A public key cryptosystem and a signature scheme based on di.. (context) - Gamal - 1985
177 Public-key cryptosystems provably secure against chosen ciph.. - Naor, Yung - 1990
176 Timestamps in key distribution protocols (context) - Denning, Sacco - 1981
174 Safeguarding cryptographic keys (context) - Blakley - 1979
174 How to exchange secrets by oblivious transfer (context) - Rabin - 1981
170 Shift Register Sequences (context) - Golomb - 1982
168 An improved algorithm for computing logarithms over GF (context) - Pohlig, Hellman - 1978
167 Pseudo-random generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
165 Optimal asymmetric encryption - Bellare, Rogaway - 1994
164 ACM Transactions on computer systems (context) - Burrows, Abadi et al.
159 Non-interactive and information-theoretic secure verifiable .. (context) - Pedersen - 1992
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
147 Efficient signature generation by smart cards (context) - Schnorr - 1991
134 Factoring integers with elliptic curves (context) - Lenstra - 1987
133 A practical scheme for non-interactive verifiable secret sha.. (context) - Feldman - 1987
130 Provably secure session key distribution-- the three party c.. - Bellare, Rogaway - 1995
127 Verifiable secret sharing and multiparty protocols with hone.. (context) - Rabin, Ben-Or - 1989
120 Unbiased bits from sources of weak randomness and probabilis.. - Chor, Goldreich - 1988
120 Robust threshold dss signatures - Gennaro, Jarecki et al. - 1996
110 Proofs that yield nothing but their validity and a methodolo.. (context) - Goldreich, Micali et al. - 1986
109 Verifiable secret sharing and achieving simultaneity in the .. (context) - Chor, Goldwasser et al. - 1985
104 A certified digital signature (context) - Merkle - 1990
103 A proposal for a new block encryption standard - Lai, Massey - 1990
103 A simple unpredictable pseudo-random number generator (context) - Blum, Blum et al. - 1986
100 Founding cryptography on oblivious transfer (context) - Kilian - 1988
99 One-way functions are necessary and sufficient for secure si.. (context) - Rompel - 1990
98 An Introduction to the Theory of Numbers (context) - Niven, Zuckerman - 1972
97 the security of public key protocols (context) - Dolev, Yao - 1981
95 The security of cipher block chaining - Bellare, Kilian et al. - 1994
92 Riemann's hypothesis and tests for primality (context) - Miller - 1976
88 Approximate formulas for some functions of prime numbers (context) - Rosser, Schoenfield - 1962
87 Authentication and authenticated key exchanges - Diffie, Van Oorschot et al. - 1992
84 Noninteractive zero-knowledge - Blum, De Santis et al. - 1991
79 One-way functions are essential for complexity based cryptog.. (context) - Impagliazzo, Luby - 1989
78 Probabilistic algorithms for testing primality (context) - Rabin - 1980
77 RSA Encryption Standard (context) - Security, PKCS - 1991
75 Shared generation of authenticators and signatures (context) - Desmedt, Frankel - 1992
72 Constructing digital signatures from a one-way function (context) - Lamport - 1979
72 How to share a function securely (context) - De Santis, Desmedt et al. - 1994
72 Elliptic curves over finite fields and the computation of sq.. (context) - Schoof
70 Hiding information and signatures in trapdoor knapsacks (context) - Merkle, Hellman - 1978
64 Robust and efficient sharing of rsa functions - Gennaro, Jarecki et al. - 1996
64 Secret sharing homomorphisms: Keeping shares of a secret sha.. (context) - Benaloh - 1987
63 Receipt-free secret ballot elections (context) - Benaloh, Tuinstra - 1994
63 An efficient probabilistic public-key encryption scheme whic.. (context) - Blum, Goldwasser - 1985
61 A design principle for hash functions (context) - Damgard - 1990
60 Solving low-density subset sum problems (context) - Lagarias, Odlyzko - 1983
59 Information technology security techniques -- digital signat.. (context) - IEC - 1991
57 Distributed provers with applications to undeniable signatur.. (context) - Pedersen - 1991
56 Systematic design of two-party authentication protocols - Bird, Gopal et al. - 1992
55 Hardness of computing the most significant bits of secret ke.. (context) - Boneh, Venkatesan - 1996
55 Pseudo-random generators under uniform assumptions (context) - Hastad - 1990
54 Multi-authority secret-ballot elections with linear work - Cramer, Franklin et al. - 1996
53 Verifiable secret ballot elections (context) - Benaloh - 1987
51 On distinguishing prime numbers from composite numbers (context) - Adleman, Pomerance et al. - 1983
51 Skeme: A versatile secure key exchange mechanism for interne.. - Krawczyk - 1996
50 The number field sieve - Lenstra, Lenstra et al. - 1990
49 Incremental cryptography: the case of hashing and signing - Bellare, Goldreich et al. - 1994
47 Discrete logarithms in finite fields and their cryptographic.. - Odlyzko - 1985
43 European Transactions on Telecommunications (context) - Desmedt - 1994
43 Cryptographic Message Syntax Standard (context) - Security, PKCS - 1991
43 Bucket hashing and its application to fast message authentic.. - Rogaway - 1995
41 Generating quasi-random sequences from slightly-random sourc.. (context) - Santha, Vazirani - 1984
40 Witness-based cryptographic program checking and robust func.. - Frankel, Gemmell et al. - 1996
40 MDx-MAC and building fast MACs from hash functions - Preneel, Van Oorschot - 1995
39 Algorithms in number theory (context) - Lenstra, Lenstra - 1990
39 Pseudorandom functions revisited: The cascade construction - Bellare, Canetti et al. - 1996
38 Solving simultaneous modular equations of low degree (context) - Hastad - 1988
38 A knapsack type public-key cryptosystem based on arithmetic .. - Chor, Rivest - 1988
38 Almost all primes can be quickly certified (context) - Goldwasser, Kilian - 1986
37 the security of multi-party ping-pong protocols - Even, Goldreich - 1983
36 Recognizing primes in random polynomial time (context) - Adleman, Huang - 1987
34 the security of ping-pong protocols (context) - Dolev, Even et al. - 1983
32 Coin flipping by telephone (context) - Blum - 1982
32 Synthesizers and their application to the parallel construct.. - Naor, Reingold - 1995
31 How to sign given any trapdoor function (context) - Bellare, Micali - 1988
30 Factorisatio Numerorum (context) - Canfield, Erdos et al. - 1983
29 Incoercible multiparty computation - Canetti, Gennaro - 1996
29 Towards the equivalence of breaking the Diffie-Hellman proto.. - Maurer - 1994
29 How to generate factored random numbers (context) - Bach - 1988
29 Independent unbiased coin flips from a correlated biased sou.. (context) - Blum - 1984
27 Zero-knowledge simulation of boolean circuits - Brassard, Cr'epeau - 1987
27 Deniable encryption - Canetti, Dwork et al. - 1996
27 Receipt-free mix-type voting schemes (context) - Sako, Kilian - 1995
26 Two remarks concerning the Goldwasser-Micali-Rivest signatur.. - Goldreich - 1986
26 An efficient existentially unforgeable signature scheme and .. - Dwork, Naor - 1994
25 Probabilistic encryption and how to play mental poker keepin.. (context) - Goldwasser, Micali - 1982
24 The discrete logarithm modulo a composite hides o (context) - Hastad, Schrift et al. - 1993
22 Digitalized signatures as intractable as factorization (context) - Rabin - 1979
22 Operating Systems Review (context) - Needham, Schroeder - 1987
21 How to expose an eavesdropper (context) - Rivest, Shamir - 1984
21 Reconstructing truncated integer variables satisfying linear.. (context) - Frieze, Hastad et al. - 1988
21 Why and how to establish a private code on a public network (context) - Goldwasser, Micali et al. - 1982
20 the security of two MAC algorithms - Preneel, van Oorschot - 1996
19 How to simultaneously exchange a secret bit by flipping a sy.. (context) - Luby, Micali et al. - 1983
19 Solving low density knapsacks (context) - Brickell - 1984
18 How to sign given any trapdoor permutation - Bellare, Micali - 1992
17 Efficient and secure multiparty generation of digital signat.. (context) - Cerecedo, Matsumoto et al. - 1993
16 Multiuser cryptographic techniques (context) - Diffie, Hellman - 1976
15 Georgia Institute of Technology (context) - Merritt, PhD - 1983
15 Polynomial factorization and non-randomness of bits of algeb.. (context) - Kannan, Lenstra et al. - 1984
14 A pseudo-random bit generator based on elliptic logarithms (context) - Kaliski - 1987
14 A provably secure oblivious transfer protocol (context) - Berger, Peralta et al. - 1985
14 Strong signature schemes (context) - Goldwasser, Micali et al. - 1983
14 Inferring a sequence generated by a linear congruence (context) - Plumstead - 1982
14 Security proofs for signatures (context) - Pointcheval, Stern - 1996
14 Cryptanalytic attacks on the multiplicative knapsack scheme .. - Odlyzko - 1984
13 A study of password security (context) - Luby, Rackoff - 1988
12 On breaking generalized knapsack public key cryptosystems (context) - Adleman - 1983
12 How to cheat at mental poker (context) - Lipton - 1981
12 Elliptic Curves and Cryptography: A Pseudorandom Bit Generat.. (context) - Kaliski - 1988
12 A Public-Key System Based on Algebraic Coding Theory (context) - McEliece - 1978
11 and public key systems (context) - Merkle, authentication - 1979
11 Factoring numbers using singular integers (context) - Adleman - 1990
11 A proposed federal information processing standard for digit.. (context) - for, Technology - 1991
11 threshold digital signature scheme and digital multisignatur.. (context) - Harn - 1994
11 Message authentication with MD (context) - Kaliski, Robshaw - 1995
10 Completeness theorems for fault-tolerant distributed computi.. (context) - Ben-Or, Goldwasser et al. - 1988
9 Lecture notes on the complexity of some problems in number t.. (context) - Angluin - 1982
9 Hybrid key distribution scheme giving key record recovery (context) - Johnson, Lee et al. - 1994
9 The efficient construction of an unbiased random sequence (context) - Elias - 1972
8 Evaluating logarithms in GF (context) - Coppersmith - 1984
6 RFC 1423: Privacy Enhancement for Internet Electronic Mail: .. (context) - Balenson - 1993
5 Previously published in ACM STOC '83 proceedings (context) - Blum, exchange et al. - 1983
5 Efficient multiparty protocols using circuit randomization (context) - Beaver - 1992
5 Rabin functions: certain parts are as hard as the whole (context) - Alexi, Chor et al. - 1988
3 Cambridge Philosophical Society (context) - Pollard, factorization et al. - 1974
3 Every prime has a succint certificate (context) - Pratt - 1975
3 The discrete logarithm problem hides O (context) - Long, Wigderson - 1988
3 New elgamal type threshold signature scheme (context) - Park, Kurosawa - 1996
1 Internet draft draft-ietf-ipsec-hmac-md5-txt (context) - Krawczyk, Bellare et al. - 1996
1 Verification by anonymous monitors (context) - Chaum - 1982
1 Md5 is not collision-free (context) - Dobbertin - 1996
1 RSA Labs Cryptobytes (context) - Johnson, Matyas et al. - 1996
1 Symmetric encryption (context) - Bellare, Rogaway - 1996
The graph only includes citing articles where the year of publication is known.
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