We derive impossibility (converse) bounds for the efficiency of implementing information theoretically secure oblivious transfer and bit commitment using correlated observations. Our approach is based on relating these problems to that of testing if the observations of the parties are conditionally independent given the adversary's observation. The resulting bounds strengthen and improve upon several previously known results
Abstract Bit commitment involves the submission of evidence from one party to another so that the ev...
Abstract—We study a problem of secure computation by multiple parties of a given function of their c...
This paper proposes a different approach to pinpoint the causes for which an unconditionally secure ...
We derive impossibility (converse) bounds for the efficiency of implementing information theoretical...
We consider information theoretic secret key (SK) agreement and secure function computation by multi...
Abstract. We consider secret key agreement by multiple parties observ-ing correlated data and commun...
Viewed through the lens of information-theoretic cryptography, almost all nontrivial two-party secur...
We consider the problem of basing Oblivious Transfer (OT)and Bit Commitment (BC), with information t...
Abstract We investigate the extent to which correlated secret random-ness can help in secure computa...
Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits t...
The ``impossibility proof'' on unconditionally secure quantum bit commitment is critically analyzed....
Abstract. Due to its universality oblivious transfer (OT) is a primitive of great importance in secu...
In cryptographic protocols, honest parties would prefer that their security is assured even in prese...
A distributed binary hypothesis testing problem involving three parties, a remote node, called the o...
We provide a simple method to obtain an upper bound on the secret key rate that is particularly suit...
Abstract Bit commitment involves the submission of evidence from one party to another so that the ev...
Abstract—We study a problem of secure computation by multiple parties of a given function of their c...
This paper proposes a different approach to pinpoint the causes for which an unconditionally secure ...
We derive impossibility (converse) bounds for the efficiency of implementing information theoretical...
We consider information theoretic secret key (SK) agreement and secure function computation by multi...
Abstract. We consider secret key agreement by multiple parties observ-ing correlated data and commun...
Viewed through the lens of information-theoretic cryptography, almost all nontrivial two-party secur...
We consider the problem of basing Oblivious Transfer (OT)and Bit Commitment (BC), with information t...
Abstract We investigate the extent to which correlated secret random-ness can help in secure computa...
Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits t...
The ``impossibility proof'' on unconditionally secure quantum bit commitment is critically analyzed....
Abstract. Due to its universality oblivious transfer (OT) is a primitive of great importance in secu...
In cryptographic protocols, honest parties would prefer that their security is assured even in prese...
A distributed binary hypothesis testing problem involving three parties, a remote node, called the o...
We provide a simple method to obtain an upper bound on the secret key rate that is particularly suit...
Abstract Bit commitment involves the submission of evidence from one party to another so that the ev...
Abstract—We study a problem of secure computation by multiple parties of a given function of their c...
This paper proposes a different approach to pinpoint the causes for which an unconditionally secure ...
DOI
Add to ORKG