On the black-box complexity of optimally-fair coin tossing
A fair two-party coin tossing protocol is one in which both parties output the same bit that is
almost uniformly distributed (ie, it equals 0 and 1 with probability that is at most negligibly far …
almost uniformly distributed (ie, it equals 0 and 1 with probability that is at most negligibly far …
On complete primitives for fairness
For secure two-party and multi-party computation with abort, classification of which primitives
are complete has been extensively studied in the literature. However, for fair secure …
are complete has been extensively studied in the literature. However, for fair secure …
[BOOK][B] Information-theoretic Cryptography
H Tyagi, S Watanabe - 2023 - books.google.com
This book offers a mathematical foundation for modern cryptography. It is primarily intended
as an introduction for graduate students. Readers should have basic knowledge of …
as an introduction for graduate students. Readers should have basic knowledge of …
Secure computation from elastic noisy channels
Noisy channels enable unconditionally secure multi-party computation even against parties
with unbounded computational power. But inaccurate noise estimation and adversarially …
with unbounded computational power. But inaccurate noise estimation and adversarially …
A unified characterization of completeness and triviality for secure function evaluation
We present unified combinatorial characterizations of completeness for 2-party secure
function evaluation (SFE) against passive and active corruptions in the information-theoretic …
function evaluation (SFE) against passive and active corruptions in the information-theoretic …
Secure computation based on leaky correlations: high resilience setting
Correlated private randomness, or correlation in short, is a fundamental cryptographic
resource that helps parties compute securely over their private data. An offline …
resource that helps parties compute securely over their private data. An offline …
Feasibility and completeness of cryptographic tasks in the quantum world
It is known that cryptographic feasibility results can change by moving from the classical to
the quantum world. With this in mind, we study the feasibility of realizing functionalities in the …
the quantum world. With this in mind, we study the feasibility of realizing functionalities in the …
Black-box use of one-way functions is useless for optimal fair coin-tossing
A two-party fair coin-tossing protocol guarantees output delivery to the honest party even
when the other party aborts during the protocol execution. Cleve (STOC–1986) …
when the other party aborts during the protocol execution. Cleve (STOC–1986) …
A zero-one law for cryptographic complexity with respect to computational UC security
It is well-known that most cryptographic tasks do not have universally composable (UC)
secure protocols, if no trusted setup is available in the framework. On the other hand, if a …
secure protocols, if no trusted setup is available in the framework. On the other hand, if a …
Completeness theorems with constructive proofs for finite deterministic 2-party functions
D Kraschewski, J Müller-Quade - Theory of Cryptography: 8th Theory of …, 2011 - Springer
In this paper we present simple but comprehensive combinatorial criteria for completeness
of finite deterministic 2-party functions with respect to information-theoretic security. We give …
of finite deterministic 2-party functions with respect to information-theoretic security. We give …