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