Peter Gemmell

According to our database, Peter Gemmell authored at least 21 papers between 1991 and 2002.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

2002

Authenticated Key Exchange Provably Secure Against the Man-in-the-Middle Attack.

Anna M. Johnston, Peter Gemmell

J. Cryptol., 2002

2001

Analysis of a Subset Sum Randomizer.

Peter Gemmell, Anna M. Johnston

IACR Cryptol. ePrint Arch., 2001

2000

Efficient and Fresh Cerification.

Irene Gassko, Peter Gemmell, Philip D. MacKenzie

Proceedings of the Public Key Cryptography, 2000

1999

On the Cryptographic Value of The q^th Root Problem.

Cheryl L. Beaver, Peter Gemmell, Anna M. Johnston, William D. Neumann

Proceedings of the Information and Communication Security, Second International Conference, 1999

1997

On the Amount of Randomness Needed in Distributed Computations.

Bruno Codenotti, Peter Gemmell, Petr Pudlák, Janos Simon

Proceedings of the On Principles Of Distributed Systems, 1997

Checking Properties of Polynomials (Extended Abstract).

Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Optimal Resilience Proactive Public-Key Cryptosystems.

Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Proactive RSA.

Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung

IACR Cryptol. ePrint Arch., 1996

Witness-Based Cryptographic Program Checking and Robust Function Sharing.

Yair Frankel, Peter Gemmell, Moti Yung

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Witness-Based Cryptographic Program Checking and Applications (an Announcement).

Yair Frankel, Peter Gemmell, Moti Yung

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Symmetry Breaking in Anonymous Networks: Characterizations.

Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995

Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change.

Ernest F. Brickell, Peter Gemmell, David W. Kravitz

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Self-Correcting for Function Fields Transcendental Degree.

Manuel Blum, Bruno Codenotti, Peter Gemmell, Troy Shahoumian

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Average Circuit Depth and Average Communication Complexity.

Bruno Codenotti, Peter Gemmell, Janos Simon

Proceedings of the Algorithms, 1995

1994

Tight Bounds on Expected Time to Add Correctly and Add Mostly Correctly.

Peter Gemmell, Mor Harchol-Balter

Inf. Process. Lett., 1994

Checking the Correctness of Memories.

Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor

Algorithmica, 1994

Selection in the Presence of Noise: The Design of Playoff Systems.

Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

Checking approximate computations over the reals.

Sigal Ar, Manuel Blum, Bruno Codenotti, Peter Gemmell

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Codes for Interactive Authentication.

Peter Gemmell, Moni Naor

Proceedings of the Advances in Cryptology, 1993

1992

Highly Resilient Correctors for Polynomials.

Peter Gemmell, Madhu Sudan

Inf. Process. Lett., 1992

1991

Self-Testing/Correcting for Polynomials and for Approximate Functions

Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, Avi Wigderson

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991