Self-Testing/Correcting for Polynomials and for Approximate Functions - Peter Gemmell; Richard J. Lipton; Ronitt Rubinfeld; Madhu Sudan 001; Avi Wigderson (STOC, 1991)

Highly Resilient Correctors for Polynomials. - Peter Gemmell; Madhu Sudan 001 (Inf. Process. Lett., 1992)

Codes for Interactive Authentication. - Peter Gemmell; Moni Naor (CRYPTO, 1993)

Checking approximate computations over the reals. - Sigal Ar; Manuel Blum 001; Bruno Codenotti; Peter Gemmell (STOC, 1993)

Selection in the Presence of Noise: The Design of Playoff Systems. - Micah Adler; Peter Gemmell; Mor Harchol-Balter; Richard M. Karp; Claire Kenyon (SODA, 1994)

Checking the Correctness of Memories. - Manuel Blum 001; William S. Evans; Peter Gemmell; Sampath Kannan; Moni Naor (Algorithmica, 1994)

Tight Bounds on Expected Time to Add Correctly and Add Mostly Correctly. - Peter Gemmell; Mor Harchol-Balter (Inf. Process. Lett., 1994)

Average Circuit Depth and Average Communication Complexity. - Bruno Codenotti; Peter Gemmell; Janos Simon (ESA, 1995)

Self-Correcting for Function Fields Transcendental Degree. - Manuel Blum 001; Bruno Codenotti; Peter Gemmell; Troy Shahoumian (ICALP, 1995)

Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change. - Ernest F. Brickell; Peter Gemmell; David W. Kravitz (SODA, 1995)

Symmetry Breaking in Anonymous Networks: Characterizations. - Paolo Boldi; Shella Shammah; Sebastiano Vigna; Bruno Codenotti; Peter Gemmell; Janos Simon (ISTCS, 1996)

Witness-Based Cryptographic Program Checking and Applications (an Announcement). - Yair Frankel; Peter Gemmell; Moti Yung (PODC, 1996)

Witness-Based Cryptographic Program Checking and Robust Function Sharing. - Yair Frankel; Peter Gemmell; Moti Yung (STOC, 1996)

Proactive RSA. - Yair Frankel; Peter Gemmell; Philip D. MacKenzie; Moti Yung (IACR Cryptol. ePrint Arch., 1996)

Optimal Resilience Proactive Public-Key Cryptosystems. - Yair Frankel; Peter Gemmell; Philip D. MacKenzie; Moti Yung (FOCS, 1997)

Checking Properties of Polynomials (Extended Abstract). - Bruno Codenotti; Funda Ergün; Peter Gemmell; Ravi Kumar 001 (ICALP, 1997)

On the Amount of Randomness Needed in Distributed Computations. - Bruno Codenotti; Peter Gemmell; Petr Pudlák; Janos Simon (OPODIS, 1997)

On the Cryptographic Value of The qth Root Problem. - Cheryl L. Beaver; Peter Gemmell; Anna M. Johnston; William D. Neumann (ICICS, 1999)

Efficient and Fresh Cerification. - Irene Gassko; Peter Gemmell; Philip D. MacKenzie (Public Key Cryptography, 2000)

Analysis of a Subset Sum Randomizer. - Peter Gemmell; Anna M. Johnston (IACR Cryptol. ePrint Arch., 2001)

Authenticated Key Exchange Provably Secure Against the Man-in-the-Middle Attack. - Anna M. Johnston; Peter Gemmell (J. Cryptol., 2002)