Protocols for secure computations

@article{Yao1982ProtocolsFS,
  title={Protocols for secure computations},
  author={A. Yao},
  journal={23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)},
  year={1982},
  pages={160-164}
}
  • A. Yao
  • Published 1982
  • Computer Science
  • 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
The author investigates the following problem: Suppose m people wish to compute the value of a function f(x1, x2, x3, ..., xm), which is an integer-valued function of m integer variables xi of bounded range. Assume initially person Pi knows the value of xi and no other x's. Is it possible for them to compute the value of f, by communicating among themselves, without unduly giving away any information about the values of their own variables? The author gives a precise formulation of this general… Expand
Privacy and data balkanization: circumventing the barriers
TLDR
Techniques to overcome difficulty by employing private information transfer to determine whether there is a benefit from sharing data and whether there are room to negotiate acceptable prices are discussed. Expand
A party-adaptive variant of LowGear
TLDR
This paper presents a party-adaptive variant to LowGear, based on tweaks to preprocessing phase to adapt existing preprocessed data to the computation over a new set of parties without regenerating new data by rerunning the entire pre processing phase. Expand
Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security
We construct the most efficient two-round adaptively secure bit-OT in the Common Random String (\(\text {CRS} \)) model. The scheme is UC secure under the Decisional Diffie-Hellman (DDH) assumption.Expand
Semi-quantum private comparison based on Bell states
TLDR
Two semi-quantum private comparison protocols based on Bell states with the help of a semi-honest quantum third party (TP) are proposed, which are more efficient than the previous SQPC protocols and secure against some famous attacks. Expand
Private Database Search with Sublinear Query Time
TLDR
A precomputed search protocol that requires linear precomputation time but that allows logarithmic search time and is appropriate in circumstances where it is crucial that queries are answered efficiently once they become available. Expand
Quantum Privacy-Preserving Price E-Negotiation
  • Wenjie Liu, Chun-Tang Li, Yu Zheng, Yong Xu, Yinsong Xu
  • Computer Science
  • 2019
TLDR
A novel and efficient quantum solution to the 3PEN problem is proposed, where the oracle operation and the qubit comparator are utilized to obtain the comparative results of buyer’s and seller's prices, and then quantum counting is executed to summarize the total number of products which meets the trading conditions. Expand
A novel quantum solution to secure two-party distance computation
TLDR
This paper presents a quantum protocol for Secure Two-Party Distance Computation by using QKD-based Quantum Private Query, which can ensure higher security than the classical related protocols. Expand
Semi-quantum private comparison protocol with three-particle G-like states
TLDR
The results show that the protocol can resist internal and external attacks, and even if the attacker successfully steals the quantum information transmitted between TP and users, she cannot get the secret information. Expand
LEGO for Two-Party Secure Computation
TLDR
A new cut-and-choose based approach called LEGO (Large Efficient Garbled-circuit Optimization): It is specifically aimed at large circuits, and obtains a factor $\log\vert\mathcal{C}\vert$ improvement in computation and communication over previous cut- and-cho choose based solutions. Expand
A new entropic criterion model in rational secure two-party computation
TLDR
This paper proposes a secure two-party computation protocol based on entropic criterion and set the corresponding securityEntropic threshold according to different privacy requirements, and explores the relationship between secure entropy and utility function, then to select the optimal utility function within the range of secure entropics threshold. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 12 REFERENCES
Some complexity questions related to distributive computing(Preliminary Report)
  • A. Yao
  • Computer Science, Mathematics
  • STOC
  • 1979
TLDR
The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm. Expand
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
We introduce a new class of public-key functions involving a number n = pq having two large prime factors. As usual, the key n is public, while p and q are the private key used by the issuer forExpand
A method for obtaining digital signatures and public-key cryptosystems
TLDR
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys. Expand
Probabilistic encryption & how to play mental poker keeping secret all partial information
This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about theExpand
New directions in cryptography
TLDR
This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing. Expand
14th ACM Symp. on Theory of Computing
  • 14th ACM Symp. on Theory of Computing
  • 1982
Three applications of the oblivious transfer
  • 1981, to appear.
  • 1981
Three applications of the oblivious transfer: Part I: Coin flipping by telephone; part II: How to exchange secrets; part III: How to send certified electronic mail
  • Technical report,
  • 1981
Mental poker
  • Technical Report LCS/TR-125,
  • 1979
Hellman , " New directions in cryptography , " IEEE Trans . on Inform
  • Theory IT -
  • 1976
...
1
2
...