Reducing Complexity Assumptions for Statistically-Hiding Commitment

Haitner, Iftach; Horvitz, Omer; Katz, Jonathan; Koo, Chiu-Yuen; Morselli, Ruggero; Shaltiel, Ronen

doi:10.1007/11426639_4

Cited by 30 publications

(16 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2 Conditional multiple-mutual information is also called conditional kinformation [20]- [22]. 3 The definition of a balanced source here is different from that by Haitner et al [25,Sec. 3].…”

Section: A Balanced Sourcesmentioning

confidence: 99%

A Multiway Relay Channel With Balanced Sources

Ong

Timo

2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-We consider a joint source-channel coding problem on a finite-field multiway relay channel, and we give closed-form lower and upper bounds on the optimal source-channel rate. These bounds are shown to be tight for all discrete memoryless sources in a certain class P * , and we demonstrate that strict source-channel separation is optimal within this class. We show how to test whether a given source belongs to P * , we give a balanced-information regularity condition for P * , and we express P * in terms of conditional multiple-mutual informations. Finally, we show that P * is useful for a centralised storage problem.

show abstract

Section: A Balanced Sourcesmentioning

confidence: 99%

A Multiway Relay Channel With Balanced Sources

Ong

Timo

2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…One-round statistically-hiding commitments can be based on any collision-resistant hash function [19,48]. Tworound statistically-hiding commitments can be based on any claw-free collection with an efficiently recognizable index set [38,36,34] (statistically-hiding commitments can also be based on general assumptions, in particular any OWF, with non-constant rounds [61,47,46]).…”

Section: Prover Auxiliary Inputmentioning

confidence: 99%

Concurrent Knowledge Extraction in the Public-Key Model

Yao

Yung

Zhao

2010

Automata, Languages and Programming

View full text Add to dashboard Cite

Knowledge extraction is a fundamental notion, modelling machine possession of values (witnesses) in a computational complexity sense. The notion provides an essential tool for cryptographic protocol design and analysis, enabling one to argue about the internal state of protocol players without ever looking at this supposedly secret state. However, when transactions are concurrent (e.g., over the Internet) with players possessing public-keys (as is common in cryptography), assuring that entities "know" what they claim to know, where adversaries may be well coordinated across different transactions, turns out to be much more subtle and in need of re-examination. Here, we investigate how to formally treat knowledge possession by parties (with registered public-keys) interacting over the Internet. Stated more technically, we look into the relative power of the notion of "concurrent knowledge-extraction" (CKE) in the concurrent zero-knowledge (CZK) bare public-key (BPK) model.We show the potential vulnerability of man-in-the-middle (MIM) attacks turn out to be a real security threat to existing natural protocols running concurrently in the public-key model, which motivates us to introduce and formalize the notion of CKE. Then, both generic (based on standard polynomial assumptions) and efficient (employing complexity leveraging in a novel way) implementations for N P are presented for constant-round (in particular, round-optimal) concurrently knowledge-extractable concurrent zero-knowledge (CZK-CKE) arguments in the BPK model. The efficient implementation can be further high practically instantiated for specific number-theoretic language. Along the way, we discuss and clarify the various subtleties surrounding the security formulation and analysis, which provides insights into the complex CZK-CKE setting.

show abstract

“…A construction of statistically-hiding scheme (NOVY scheme) from one-way permutation was given by Naor, Ostrovsky, Venkatesan and Yung [24]. After that, the assumption of the existence of one-way permutation was relaxed to that of approximable-preimage-size one-way function [12]. Finally, Haitner and Reingold [15] showed that a statistically-hiding scheme (HNORV scheme [13]) can be based on any one-way function.…”

Section: Introductionmentioning

confidence: 99%

Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function

Koshiba

Odaira

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We provide a non-interactive quantum bit commitment scheme which has statisticallyhiding and computationally-binding properties from any quantum one-way function. Our protocol is basically a parallel composition of the previous non-interactive quantum bit commitment schemes (based on quantum one-way permutations, due to Dumais, Mayers and Salvail (EUROCRYPT 2000)) with pairwise independent hash functions. To construct our non-interactive quantum bit commitment scheme from any quantum one-way function, we follow the procedure below: (i) from Dumais-Mayers-Salvail scheme to a weakly-hiding and 1-out-of-2 binding commitment (of a parallel variant); (ii) from the weakly-hiding and 1-out-of-2 binding commitment to a strongly-hiding and 1-out-of-2 binding commitment; (iii) from the strongly-hiding and 1-out-of-2 binding commitment to a normal statistically-hiding commitment. In the classical case, statistically-hiding bit commitment scheme (by Haitner, Nguyen, Ong, Reingold and Vadhan (SIAM J. Comput., Vol.39, 2009)) is also constructible from any one-way function. While the classical statistically-hiding bit commitment has large round complexity, our quantum scheme is non-interactive, which is advantageous over the classical schemes. A main technical contribution is to provide a quantum analogue of the new interactive hashing theorem, due to Haitner and Reingold (CCC 2007). Moreover, the parallel composition enables us to simplify the security analysis drastically.Keyword: quantum bit commitment, quantum one-way function, non-interactive

show abstract

Reducing Complexity Assumptions for Statistically-Hiding Commitment

Cited by 30 publications

References 35 publications

A Multiway Relay Channel With Balanced Sources

A Multiway Relay Channel With Balanced Sources

Concurrent Knowledge Extraction in the Public-Key Model

Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function

Contact Info

Product

Resources

About