Michael Ben-Or

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 Joe Kilian

> Home > Persons > Michael Ben-Or

Publications

2019
[p1]
- view
  authority control:
- export record
  dblp key:
  - books/acm/19/Ben-OrGKW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/acm/19/Ben-OrGKW19
Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson:
Multi-prover interactive proofs: how to remove intractability assumptions. Providing Sound Foundations for Cryptography 2019: 373-410
1989
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/crypto/Ben-OrGKW89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/crypto/Ben-OrGKW89
Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson:
Efficient Identification Schemes Using Two Prover Interactive Proofs. CRYPTO 1989: 498-506
1988
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/crypto/Ben-OrGGHKMR88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/crypto/Ben-OrGGHKMR88
Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Håstad, Joe Kilian, Silvio Micali, Phillip Rogaway:
Everything Provable is Provable in Zero-Knowledge. CRYPTO 1988: 37-56
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/Ben-OrGKW88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Ben-OrGKW88
Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson:
Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. STOC 1988: 113-131

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.