Moses Liskov  Home/Search
Context
Related
| mit.edu/~cis/theses/mliskovphd.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: mit.edu/~cis/cistheses (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Cryptographic primitive research comprises much of the body of modern cryptographic research. This kind of research aims to produce useful primitives -- building blocks with which we can design systems to enforce complex and subtle security requirements. Cryptographic primitive research often involves noticing a new problem that needs a simple solution, or a di#erent way of setting up a problem; these in turn give rise to precise definitions for a primitive. In addition to this, cryptographic... (Update)
Similar documents (at the sentence level): More
12.1%: Mutually Independent Commitments - Liskov, Lysyanskaya, Micali, Reyzin, .. (2001) (Correct)
10.9%: Tweakable Block Ciphers - Liskov, Rivest, Wagner (2002) (Correct)
8.3%: Plaintext Awareness Via Key Registration - Moses (Correct)
Active bibliography (related documents): More All
0.8: Computational Soundness for Standard Assumptions of Formal.. - Herzog (2004) (Correct)
0.5: Plaintext-Simulatability - Fujisaki (2004) (Correct)
0.5: Concurrent/Resettable Zero-Knowledge with Concurrent Soundness in.. - Zhao (2003) (Correct)
Similar documents based on text: More All
0.3: Advanced Cryptography February 19, 2003 - Lecture Zk Proofs (Correct)
0.2: Concurrent General Composition of Secure Protocols - In The Timing (2005) (Correct)
0.2: Advanced Cryptography March 19, 2003 - Lecture Improved Non-Interactive (Correct)
BibTeX entry: (Update)
@misc{ liskov-new,
author = "Moses Liskov",
title = "New Tools in Cryptography: Mutually Independent Commitments, Tweakable
Block Ciphers, and Plaintext Awareness via Key Registration",
url = "citeseer.ist.psu.edu/liskov04new.html" }
Citations (may not include all citations):1529 A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978
1065 Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1997
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
326 Nonmalleable cryptography - Dolev, Dwork et al. - 2000
263 The inductive approach to verifying cryptographic protocols - Paulson - 1996
260 Relations among notions of security for public-key encryptio.. (context) - Bellare, Desai et al.
254 A practical public key cryptosystem provably secure against .. - Cramer, Shoup
206 Zero-knowledge proofs of identity (context) - Feige, Fiat et al. - 1988
194 Proofs that yield nothing but their validity or all language.. (context) - Goldreich, Micali et al. - 1991
189 Universally composable security: A new paradigm for cryptogr.. - Canetti - 2001
177 Public-key cryptosystems provably secure against chosen ciph.. - Naor, Yung - 1990
177 Completeness theorems for non-cryptographic fault-tolerant d.. (context) - Ben-Or, Goldwasser et al.
173 How to construct pseudorandom permutations from pseudorandom.. (context) - Luby, Racko - 1986
165 Optimal asymmetric encryption - Bellare, Rogaway
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
140 How to play any mental game or a completeness theorem for pr.. (context) - Goldreich, Micali et al. - 1987
131 Noninteractive zero-knowledge proofs of knowledge and the ch.. (context) - Racko, Simon
124 Bit commitment using pseudorandomness - Naor - 1991
118 Optimal asymmetric encryption -- how to encrypt with RSA (context) - Bellare, Rogaway
116 volume 576 of Lecture Notes in Computer Science (context) - Feigenbaum, in - 1992
109 Verifiable secret sharing and achieving simultaneity in the .. (context) - Chor, Goldwasser et al. - 1985
95 Multiple non-interactive zero knowledge proofs under general.. (context) - Feige, Lapidot et al. - 1999
90 IEEE Transactions on Information Theory (context) - Di and, Martin et al. - 1976
88 Knowledge complexity of interactive proofs (context) - Goldwasser, Micali et al. - 1985
85 Encryption modes with almost free message integrity - Jutla
84 New types of cryptanalytic attacks using related keys - Biham - 1994
84 Noninteractive zero-knowledge - Blum, De Santis et al. - 1991
77 Non-interactive zero-knowledge and its applications (context) - Blum, Feldman et al.
77 the construction of pseudo-random permutations: Luby-racko# .. - Naor, Reingold - 1999
72 cient identification and signatures for smart cards (context) - Schnorr
69 Zero knowledge proofs of knowledge in two rounds (context) - Feige, Shamir - 1990
64 A practical secret voting scheme for large scale elections (context) - Fujioka, Okamoto et al. - 1992
58 On defining proofs of knowledge - Bellare, Goldreich - 1993
56 UMAC: Fast and secure message authentication - Black, Halevi et al. - 1999
56 Universally composable commitments - Fischlin, Canetti
55 The notion of security for probabilistic cryptosystems (context) - Micali, Racko et al. - 1988
54 Non-malleable non-interactive zero-knowledge and adaptive ch.. - Sahai - 1999
51 Random self-reducibility and zero knowledge interactive proo.. (context) - Tompa, Woll - 1987
43 Universally composable two-party and multi-party secure comp.. - Canetti, Lindell et al. - 2002
43 Provable security for block ciphers by decorrelation - Vaudenay - 1998
40 Personal communications (context) - Katz, Ostrovsky et al.
39 Zero-knowledge proofs of knowledge without interaction (context) - De Santis, Persiano - 1992
32 Elections with unconditionally-secret ballots and disruption.. (context) - Chaum - 1988
30 A construction of a cipher from a single pseudorandom permut.. - Even, Mansour - 1997
30 Program Development in Java: Abstraction (context) - Liskov - 2000
28 Fast implementations of AES candidates - Aoki, Lipmaa - 2000
25 On fast and provably secure message authentication based on .. - Shoup - 1996
25 Probabilistic encryption and how to play mental poker keepin.. (context) - Goldwasser, Micali - 1982
25 Federal Information Processing Standards Publication 81 (context) - of - 1980
21 Soundness of formal encryption in the presence of active adv.. (context) - Micciancio, Warinschi - 2004
21 Non-interactive and non-malleable commitment - Di Crescenzo, Ishai et al. - 1998
19 Non-interactive and information-theoretic secure verifiable .. (context) - Pedersen
19 Achieving independence in logarithmic number of rounds (context) - Chor, Rabin - 1987
18 How to strengthen DES using existing hardware - Biham, Biryukov - 1994
17 Advances in Cryptology---EUROCRYPT (context) - Pfitzmann - 2001
17 A cryptographic scheme for computerized general elections (context) - Iversen
17 Tweakable block ciphers - Liskov, Rivest et al. - 2002
17 A tweakable enciphering mode - Halevi, Rogaway
16 The all-or-nothing nature of two-party secure computation - Beimel, Malkin et al. - 1999
15 Floating-point arithmetic and message authentication - Bernstein - 2000
14 Limitations of the Even-Mansour construction - Daemen - 1991
12 Plaintext awareness via key registration - Herzog, Liskov et al.
11 Advances in Cryptology---CRYPTO (context) - Kilian - 2001
11 A new multiple key cipher and an improved voting scheme (context) - Boyd
10 Mercy: A fast large block cipher for disk sector encryption - Crowley - 1978
10 cient and noninteractive non-malleable commitment (context) - Di Crescenzo, Katz et al.
10 Computational soundness for formal adversaries - Herzog - 2002
9 An identity escrow scheme with appointed verifiers - Camenisch, Lysyanskaya
8 an automatic checker for security protocol analysis (context) - Song - 1999
8 Second Edition: Protocols (context) - Schneier - 1996
6 Non-interactive zeroknowledge proof systems (context) - De Santis, Micali et al. - 1990
6 How to protect DES against exhaustive search (context) - Kilian, Rogaway - 1996
6 ciently and securely (context) - Gennaro - 1995
6 Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
5 Mutually independent commitments - Liskov, Lysyanskaya et al. - 2001
4 Necessary and su#cient assumptions for non-interactive zero-.. (context) - De Santis, Di Crescenzo et al. - 2000
4 Short non-interactive cryptographic proofs - Boyar, Damgard et al. - 2000
4 The hasty pudding cipher (context) - Schroeppel - 1999
3 Advances in Cryptology: CRYPTO (context) - Boneh - 2003
3 cient non-malleable commitment schemes (context) - Fischlin, Fischlin - 2000
2 volume 1462 of Lecture Notes in Computer Science (context) - Krawczyk, in - 1998
2 cient zero-knowledge proofs of knowledge without intractabil.. (context) - Cramer, Damgard et al. - 2000
1 Breaking and fixing the needham-schoreder public-key protoco.. (context) - Lowe - 1996
1 volume 434 of Lecture Notes in Computer Science (context) - Quisquater, Vandewalle et al. - 1990
1 volume 950 of Lecture Notes in Computer Science (context) - De Santis, in - 1995
http://www.cs.ucdavis.edu/~rogaway/ocb/ocb-doc.htm
http://www.cs.ucdavis.edu/~rogaway/ocb/ocb-doc.htm
Documents on the same site (http://theory.lcs.mit.edu/~cis/cis-theses.html): More
SPKI/SDSI Secure Web Server Project - Maywah (1999) (Correct)
Design and Analysis of an Anonymous Communications Channel for.. - Freedman (2000) (Correct)
Pseudonym Systems - Lysyanskaya, Rivest, Sahai (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