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

A Two-Party Protocol with Trusted Initializer for Computing the Inner Product

Rafael Dowsley, Jeroen van de Graaf, Davidson Marques, Anderson C. A. Nascimento

Published Jan 1, 2011• 24 citations
Publisher
DOI
10.1007/978-3-642-17955-6_25

Related papers

An Improved Secure Two-Party Computation Protocol

Yu Yu, Jussipekka Leiwo, A. Benjamin Premkumar

Lecture notes in computer science•Jan 1, 2005•1 citation

A Two-Party Protocol with Trusted Initializer for Computing the Inner Product.

Rafael Dowsley, Jeroen van de Graaf, Davidson Marques +1 more

Abstract. We propose the first protocol for securely computing the inner product modulo an integer m between two distrustful parties based on a trusted initializer, i.e. a trusted party that interacts with the players solely during a setup phase. We obtain a very simple protocol with universally composable security. As an application of our protocol, we obtain a solution for securely computing linear equations. 1

•Jan 1, 2010•0 citations

Unconditionally Secure, Universally Composable Privacy Preserving Linear Algebra

Bernardo David, Rafael Dowsley, Jeroen van de Graaf +3 more

Linear algebra operations on private distributed data are frequently required in several practical scenarios (e.g., statistical analysis and privacy preserving databases). We present universally composable two-party protocols to compute inner products, determinants, eigenvalues, and eigenvectors. These protocols are built for a two-party scenario where the inputs are provided by mutually distrustful parties. After execution, the protocols yield the results of the intended operation while preserving the privacy of their inputs. Universal composability is obtained in the trusted initializer model, ensuring information theoretical security under arbitrary protocol composition in complex environments. Furthermore, our protocols are computationally efficient since they only require field multiplication and addition operations.

IEEE Transactions on Information Forensics and Security•Sep 3, 2015•17 citations

A protocol for the secure two-party quantum scalar product

Li-Bao He, Liusheng Huang, Wei Yang +1 more

Physics Letters A•Feb 28, 2012•14 citations

An Efficient Protocol for Fair Secure Two-Party Computation

Mehmet Sabır Kiraz, Berry Schoenmakers

Lecture notes in computer science•Apr 4, 2008•16 citations

Secure Two-party Computation for Equality of Bilateral Data Based on Pinhole Camera Model

Changfeng Gui, Mengsi Han, Wei He +1 more

Secure two-party computation is always the focus in the international cryptographic community, and establishing a secure two-party computation for determining the equality of data is a fundamental and crucial task within this field.There is still substantial room for improvement in terms of efficiency and security, so it is worth exploring further.In this paper, two theorems are proved from camera imaging of straight lines on a flat surface and the equality judgement of data between the two-party is innovatively converted into judging whether the inner products of the vectors owned by the two parties are zeroes.Based on the specific property of these vectors, a security protocol is established to determine whether those inner products are zeroes, which realizes the protocol scheme of judging the data equality of two-party under the semi-honest model and analyses its security theoretically.The scheme needs key stream for dynamic data encoding, since only basic arithmetic operations (integer addition, subtraction and multiplication) and a final modulus operation are required after encode without high-order and decimal operations, and the communication complexity is O(1), which greatly improves the efficiency.This scheme may not fit for malicious model, we could use the existing agreements of malicious model to determine whether those inner products are zeroes, by the conversion in this paper we also could complete the equality judgement.

Advances in physics research/Advances in Physics Research•Jan 1, 2024•0 citations
Linear algebra operations on private distributed data are frequently required in several practical scenarios (e.g., statistical analysis and privacy preserving databases). We present universally composable two-party protocols to compute inner products, determinants, eigenvalues, and eigenvectors. These protocols are built for a two-party scenario where the inputs are provided by mutually distrustful parties. After execution, the protocols yield the results of the intended operation while preserving the privacy of their inputs. Universal composability is obtained in the trusted initializer model, ensuring information theoretical security under arbitrary protocol composition in complex environments. Furthermore, our protocols are computationally efficient since they only require field multiplication and addition operations.
Secure two-party computation is always the focus in the international cryptographic community, and establishing a secure two-party computation for determining the equality of data is a fundamental and crucial task within this field.There is still substantial room for improvement in terms of efficiency and security, so it is worth exploring further.In this paper, two theorems are proved from camera imaging of straight lines on a flat surface and the equality judgement of data between the two-party is innovatively converted into judging whether the inner products of the vectors owned by the two parties are zeroes.Based on the specific property of these vectors, a security protocol is established to determine whether those inner products are zeroes, which realizes the protocol scheme of judging the data equality of two-party under the semi-honest model and analyses its security theoretically.The scheme needs key stream for dynamic data encoding, since only basic arithmetic operations (integer addition, subtraction and multiplication) and a final modulus operation are required after encode without high-order and decimal operations, and the communication complexity is O(1), which greatly improves the efficiency.This scheme may not fit for malicious model, we could use the existing agreements of malicious model to determine whether those inner products are zeroes, by the conversion in this paper we also could complete the equality judgement.