dblp.uni-trier.dewww.uni-trier.de

Peter Gemmell

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2002
21EEAnna M. Johnston, Peter Gemmell: Authenticated Key Exchange Provably Secure Against the Man-in-the-Middle Attack. J. Cryptology 15(2): 139-148 (2002)
2000
20 Irene Gassko, Peter Gemmell, Philip D. MacKenzie: Efficient and Fresh Cerification. Public Key Cryptography 2000: 342-353
1999
19 Cheryl L. Beaver, Peter Gemmell, Anna M. Johnston, William D. Neumann: On the Cryptographic Value of The qth Root Problem. ICICS 1999: 135-142
1997
18EEYair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung: Proactive RSA. CRYPTO 1997: 440-454
17EEYair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung: Optimal Resilience Proactive Public-Key Cryptosystems. FOCS 1997: 384-393
16 Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar: Checking Properties of Polynomials (Extended Abstract). ICALP 1997: 203-213
15 Bruno Codenotti, Peter Gemmell, Petr Pudlak, Janos Simon: On the Amount of Randomness Needed in Distributed Computations. OPODIS 1997: 237-248
1996
14 Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon: Symmetry Breaking in Anonymous Networks: Characterizations. ISTCS 1996: 16-26
13 Yair Frankel, Peter Gemmell, Moti Yung: Witness-Based Cryptographic Program Checking and Applications (an Announcement). PODC 1996: 211
12EEYair Frankel, Peter Gemmell, Moti Yung: Witness-Based Cryptographic Program Checking and Robust Function Sharing. STOC 1996: 499-508
1995
11 Bruno Codenotti, Peter Gemmell, Janos Simon: Average Circuit Depth and Average Communication Complexity. ESA 1995: 102-112
10 Manuel Blum, Bruno Codenotti, Peter Gemmell, Troy Shahoumian: Self-Correcting for Function Fields Transcendental Degree. ICALP 1995: 547-557
9 Ernest F. Brickell, Peter Gemmell, David W. Kravitz: Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change. SODA 1995: 457-466
1994
8 Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon: Selection in the Presence of Noise: The Design of Playoff Systems. SODA 1994: 564-572
7 Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor: Checking the Correctness of Memories. Algorithmica 12(2/3): 225-244 (1994)
6 Peter Gemmell, Mor Harchol-Balter: Tight Bounds on Expected Time to Add Correctly and Add Mostly Correctly. Inf. Process. Lett. 49(2): 77-83 (1994)
1993
5EEPeter Gemmell, Moni Naor: Codes for Interactive Authentication. CRYPTO 1993: 355-367
4EESigal Ar, Manuel Blum, Bruno Codenotti, Peter Gemmell: Checking approximate computations over the reals. STOC 1993: 786-795
1992
3 Peter Gemmell, Madhu Sudan: Highly Resilient Correctors for Polynomials. Inf. Process. Lett. 43(4): 169-174 (1992)
1991
2 Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor: Checking the Correctness of Memories FOCS 1991: 90-99
1 Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, Avi Wigderson: Self-Testing/Correcting for Polynomials and for Approximate Functions STOC 1991: 32-42

Coauthor Index

1Micah Adler [8]
2Sigal Ar [4]
3Cheryl L. Beaver [19]
4Manuel Blum [2] [4] [7] [10]
5Paolo Boldi [14]
6Ernest F. Brickell [9]
7Bruno Codenotti [4] [10] [11] [14] [15] [16]
8Funda Ergün [16]
9William S. Evans [2] [7]
10Yair Frankel [12] [13] [17] [18]
11Irene Gassko [20]
12Mor Harchol-Balter [6] [8]
13Anna M. Johnston [19] [21]
14Sampath Kannan [2] [7]
15Richard M. Karp [8]
16David W. Kravitz [9]
17Ravi Kumar (S. Ravi Kumar) [16]
18Richard J. Lipton [1]
19Philip D. MacKenzie [17] [18] [20]
20Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [8]
21Moni Naor [2] [5] [7]
22William D. Neumann [19]
23Petr Pudlak [15]
24Ronitt Rubinfeld [1]
25Troy Shahoumian [10]
26Shella Shammah [14]
27Janos Simon [11] [14] [15]
28Madhu Sudan [1] [3]
29Sebastiano Vigna [14]
30Avi Wigderson [1]
31Moti Yung (Mordechai M. Yung) [12] [13] [17] [18]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)