Ran Raz

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 Ivan Damgård

> Home > Persons > Ran Raz

Publications

2013
[c64]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/crypto/CohenDIKMRR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/crypto/CohenDIKMRR13
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum:
Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). CRYPTO (2) 2013: 185-202
[i50]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/CohenDIKMRR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/CohenDIKMRR13
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron Rothblum:
Efficient Multiparty Protocols via Log-Depth Threshold Formulae. Electron. Colloquium Comput. Complex. TR13 (2013)
[i44]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/CohenDIKMRR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/CohenDIKMRR13
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum:
Efficient Multiparty Protocols via Log-Depth Threshold Formulae. IACR Cryptol. ePrint Arch. 2013: 480 (2013)

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.