Michael O. Rabin

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Christopher Thorpe

> Home > Persons > Michael O. Rabin

Publications

2009
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/fc/ParkesRT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fc/ParkesRT09
David C. Parkes, Michael O. Rabin, Christopher Thorpe:
Cryptographic Combinatorial Clock-Proxy Auctions. Financial Cryptography 2009: 305-324
2008
[j27]
- view
  authority control:
- export record
  dblp key:
  - journals/ecra/ParkesRST08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ecra/ParkesRST08
David C. Parkes, Michael O. Rabin, Stuart M. Shieber, Christopher Thorpe:
Practical secrecy-preserving, verifiably correct and trustworthy auctions. Electron. Commer. Res. Appl. 7(3): 294-312 (2008)
2007
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/lics/RabinST07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lics/RabinST07
Michael O. Rabin, Rocco A. Servedio, Christopher Thorpe:
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications. LICS 2007: 63-76
2006
[c32]
- view
  authority control:
- export record
  dblp key:
  - conf/ACMicec/ParkesRST06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ACMicec/ParkesRST06
David C. Parkes, Michael O. Rabin, Stuart M. Shieber, Christopher Thorpe:
Practical secrecy-preserving, verifiably correct and trustworthy auctions. ICEC 2006: 70-81

a service of

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.