default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Gemmell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j4]Anna M. Johnston, Peter Gemmell:
Authenticated Key Exchange Provably Secure Against the Man-in-the-Middle Attack. J. Cryptol. 15(2): 139-148 (2002)- 2001
- [i2]Peter Gemmell, Anna M. Johnston:
Analysis of a Subset Sum Randomizer. IACR Cryptol. ePrint Arch. 2001: 18 (2001) - 2000
- [c17]Irene Gassko, Peter Gemmell, Philip D. MacKenzie:
Efficient and Fresh Cerification. Public Key Cryptography 2000: 342-353
1990 – 1999
- 1999
- [c16]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
- [c15]Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung:
Proactive RSA. CRYPTO 1997: 440-454 - [c14]Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung:
Optimal Resilience Proactive Public-Key Cryptosystems. FOCS 1997: 384-393 - [c13]Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar:
Checking Properties of Polynomials (Extended Abstract). ICALP 1997: 203-213 - [c12]Bruno Codenotti, Peter Gemmell, Petr Pudlák, Janos Simon:
On the Amount of Randomness Needed in Distributed Computations. OPODIS 1997: 237-248 - 1996
- [c11]Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon:
Symmetry Breaking in Anonymous Networks: Characterizations. ISTCS 1996: 16-26 - [c10]Yair Frankel, Peter Gemmell, Moti Yung:
Witness-Based Cryptographic Program Checking and Applications (an Announcement). PODC 1996: 211 - [c9]Yair Frankel, Peter Gemmell, Moti Yung:
Witness-Based Cryptographic Program Checking and Robust Function Sharing. STOC 1996: 499-508 - [i1]Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung:
Proactive RSA. IACR Cryptol. ePrint Arch. 1996: 12 (1996) - 1995
- [c8]Bruno Codenotti, Peter Gemmell, Janos Simon:
Average Circuit Depth and Average Communication Complexity. ESA 1995: 102-112 - [c7]Manuel Blum, Bruno Codenotti, Peter Gemmell, Troy Shahoumian:
Self-Correcting for Function Fields Transcendental Degree. ICALP 1995: 547-557 - [c6]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
- [j3]Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor:
Checking the Correctness of Memories. Algorithmica 12(2/3): 225-244 (1994) - [j2]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) - [c5]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 - 1993
- [c4]Peter Gemmell, Moni Naor:
Codes for Interactive Authentication. CRYPTO 1993: 355-367 - [c3]Sigal Ar, Manuel Blum, Bruno Codenotti, Peter Gemmell:
Checking approximate computations over the reals. STOC 1993: 786-795 - 1992
- [j1]Peter Gemmell, Madhu Sudan:
Highly Resilient Correctors for Polynomials. Inf. Process. Lett. 43(4): 169-174 (1992) - 1991
- [c2]Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor:
Checking the Correctness of Memories. FOCS 1991: 90-99 - [c1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
