International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR Local Search

Possible queries include homomorphic author:david.
Found 20000 results
Tight Bounds for Classical and Quantum Coin Flipping
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=23532
Esther Hänggi Jürg Wullschleger
Tcc 2011
TCC 2011
https://iacr.org/workshops/tcc2011/accepted.html
Eighth IACR Theory of Cryptography Conference TCC 2011 March 28-30, 2011, Brown University Providence, Rhode Island, USA This page requires iframes. TCC 2011 Accepted Papers Secure Two-Party Computation via Cut-and-Choose...
TCC 2011
https://iacr.org/workshops/tcc2011/accepted-dec14.html
Eighth IACR Theory of Cryptography Conference TCC 2011 March 28-30, 2011, Brown University Providence, Rhode Island, USA This page requires iframes. TCC 2011 Accepted Papers Secure Two-Party Computation via Cut-and-Choose...
TCC 2011
https://iacr.org/workshops/tcc2011/program.html
Eighth IACR Theory of Cryptography Conference TCC 2011 March 28-30, 2011, Brown University Providence , Rhode Island , USA This page requires iframes. Preliminary Program (All the talks will be held at MacMillan Hall ) Sunday,...
IACR TCC 2011
https://iacr.org/archive/tcc2011/tcc2011-index.html
TCC 2011: Yuval Ishai (Eds.): Theory of Cryptography - 8th Theory of Cryptography Conference - TCC 2011, TCC 2011, Providence, RI, USA, March 28-30, 2011 Proceedings. TCC 2011 Providence, RI, USA, March 28-30, 2011 Preface by...
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
Eprint
https://eprint.iacr.org/2011/065
Carolin Lunemann Jesper Buus Nielsen
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented with quantum-computational security without any...
last revised 23 Jun 2011
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=23955
Severin Winkler Jürg Wullschleger
Crypto 2010
An Optimally Fair Coin Toss
Eprint
https://eprint.iacr.org/2009/214
Tal Moran Moni Naor Gil Segev
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common unbiased random bit, guaranteeing that even if...
last revised 4 Jan 2015
Quantum-Secure Coin-Flipping and Applications
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=18540
Ivan Damgård Carolin Lunemann
Asiacrypt 2009
Author Index, IACR Theory of Cryptography (TCC) 2011
https://iacr.org/archive/tcc2011/author-index.html
Author Index, IACR Theory of Cryptography (TCC) 2011 Bellare, Mihir, 232 Bogdanov, Andrej, 1 Boneh, Dan, 250 Brakerski, Zvika, 198 , 555 Bronson, Josh, 500 Döttling, Nico, 162 Dachman-Soled, Dana, 446 Damgård, Ivan, 142...
Esther Hänggi
Author
https://iacr.org/cryptodb/data/author.php?authorkey=7538
Efficient Device-Independent Quantum Key Distribution
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=24012
Esther Hänggi Renato Renner Stefan Wolf
Eurocrypt 2010
Jürg Wullschleger
Author
https://iacr.org/cryptodb/data/author.php?authorkey=1374
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Eprint
https://eprint.iacr.org/2009/508
Severin Winkler Juerg Wullschleger
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditionally secure way, but there are many reductions...
last revised 12 Aug 2010
Adaptively Secure Coin-Flipping, Revisited
Eprint
https://eprint.iacr.org/2015/202
Shafi Goldwasser Yael Tauman Kalai Sunoo Park
The full-information model was introduced by Ben-Or and Linial in 1985 to study collective coin-flipping: the problem of generating a common bounded-bias bit in a network of $n$ players with $t=t(n)$ faults. They showed that...
last revised 4 May 2015
On the Complexity of Fair Coin Flipping
Eprint
https://eprint.iacr.org/2018/901
Iftach Haitner Nikolaos Makriyannis Eran Omri
A two-party coin-flipping protocol is $\epsilon$-fair if no efficient adversary can bias the output of the honest party (who always outputs a bit, even if the other party aborts) by more than $\epsilon$. Cleve [STOC '86]...
received 24 Sep 2018
On the Complexity of Fair Coin Flipping
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=28998
Iftach Haitner Nikolaos Makriyannis Eran Omri
Tcc 2018
A two-party coin-flipping protocol is $$\varepsilon $$ε-fair if no efficient adversary can bias the output of the honest party (who always outputs a bit, even if the other party aborts) by more than $$\varepsilon $$ε. Cleve...
New Monotones and Lower Bounds in Unconditional Two-Party Computation
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=1839
Stefan Wolf Jürg Wullschleger
Crypto 2005
Coin Flipping by Telephone
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=917
Manuel Blum
Crypto 1981
Robust Coin Flipping
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=24242
Gene S. Kopp John D. Wiltshire-Gordon
Eurocrypt 2012
Next ►