Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Joint Conference on e-Business and Telecommunications (ICETE)

Efficient Constructions of Non-interactive Secure Multiparty Computation from Pairwise Independent Hashing

Satoshi Obana, Maki Yoshida

Published Jan 1, 2020• 2 citations
Publisher
DOI
10.5220/0009819203220329

Related papers

An Efficient Construction of Non-Interactive Secure Multiparty Computation

Satoshi Obana, Maki Yoshida

Lecture notes in computer science•Jan 1, 2016•4 citations

Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions

Reo Eriguchi, Kazuma Ohara, Shota Yamada +1 more

Lecture notes in computer science•Jan 1, 2021•5 citations

On the (In)Efficiency of Non-Interactive Secure Multiparty Computation

Maki Yoshida, Satoshi Obana

Lecture notes in computer science•Jan 1, 2016•5 citations

Non-Interactive Secure Multiparty Computation

Amos Beimel, Ariel Gabizon, Yuval Ishai +3 more

Lecture notes in computer science•Jan 1, 2014•83 citations

Non-Interactive Statistically-Hiding Quantum Bit Commitment from Any Quantum One-Way Function

Takeshi Koshiba, Takanori Odaira

We provide a non-interactive quantum bit commitment scheme which has statistically-hiding 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.

arXiv:1102.3441•Feb 16, 2011•17 citations

Efficient Round-Optimal Secure Two-Party Computation from Sigma-protocol

Yonglong Tang, Chunming Tang

In this paper, based on Sigma-protocol on HC (a NP-complete language), we firstly construct a Sigma-protocol for any NP language thm1 ∧ thm2, then transfer it into a non-interactive protocol from a hash function and a pseudo-random generator. Finally, we construct an efficient round-optimal secure two-party computation protocol from our non-interactive protocols.

•Apr 1, 2010•0 citations
We provide a non-interactive quantum bit commitment scheme which has statistically-hiding 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.