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

Lecture notes in computer science

Size-Hiding Computation in the Honest-But-Curious Model

Kazumasa Shinagawa

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1007/978-981-97-5028-3_16

Related papers

Size-Hiding Computation for Multiple Parties

Kazumasa Shinagawa, Koji Nuida, Takashi Nishide +2 more

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

Topology-Hiding Computation Beyond Semi-Honest Adversaries

Rio LaVigne, Chen-Da Liu-Zhang, Ueli M. Maurer +3 more

Lecture notes in computer science•Jan 1, 2018•13 citations

Communication requirements for secure computation

Deepesh Data, Vinod M. Prabhakaran

The question of whether and how mutually distrusting parties can collaborate is a central theme in cryptography. The goal of secure function computation is to ensure that parties may correctly compute functions of their data without learning additional information. A remarkable result of Ben Or, Goldwasser, and Wigderson from 1988 shows that it is possible for parties connected by pairwise, private, noise-free links to compute functions with zero error and perfect information theoretic security provided the number of parties who may collude meets a certain threshold; specifically, if the colluders form a strict minority for the honest-but-curious model and they are strictly less than a third for the malicious model. In this paper we provide basic lowerbounds on the amount of communication required to compute with zero-error and perfect security in a three-party setting under the honest-but-curious model.

Allerton Conference on Communication, Control, and Computing•Oct 1, 2013•2 citations

Two-Party Quantum Protocols Do Not Compose Securely Against Honest-But-Curious Adversaries

Louis Salvail, Miroslava Sotáková

In this paper, we build upon the model of two-party quantum computation introduced by Salvail et al. [SSS09] and show that in this model, only trivial correct two-party quantum protocols are weakly self-composable. We do so by defining a protocol Π, calling any non-trivial sub-protocol πN times and showing that there is a quantum honest-but-curious strategy that cannot be modeled by acting locally in every single copy of π. In order to achieve this, we assign a real value called "payoff" to any strategy for Πand show that that there is a gap between the highest payoff achievable by coherent and local strategies.

arXiv:0906.1671•Jun 9, 2009•8 citations

Experiments on Finite Size Scaling

WORLD SCIENTIFIC eBooks•Jul 1, 1994•0 citations

An Investigation of Finite Size Scaling

E. Brézin

Current physics sources and comments•Jan 1, 1988•2 citations
The question of whether and how mutually distrusting parties can collaborate is a central theme in cryptography. The goal of secure function computation is to ensure that parties may correctly compute functions of their data without learning additional information. A remarkable result of Ben Or, Goldwasser, and Wigderson from 1988 shows that it is possible for parties connected by pairwise, private, noise-free links to compute functions with zero error and perfect information theoretic security provided the number of parties who may collude meets a certain threshold; specifically, if the colluders form a strict minority for the honest-but-curious model and they are strictly less than a third for the malicious model. In this paper we provide basic lowerbounds on the amount of communication required to compute with zero-error and perfect security in a three-party setting under the honest-but-curious model.
In this paper, we build upon the model of two-party quantum computation introduced by Salvail et al. [SSS09] and show that in this model, only trivial correct two-party quantum protocols are weakly self-composable. We do so by defining a protocol Π, calling any non-trivial sub-protocol πN times and showing that there is a quantum honest-but-curious strategy that cannot be modeled by acting locally in every single copy of π. In order to achieve this, we assign a real value called "payoff" to any strategy for Πand show that that there is a gap between the highest payoff achievable by coherent and local strategies.