Andrew Chi-Chih Yao. Protocols for secure computations (extended abstract). In FOCS, pages 60--164, 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
National Identification Systems - Nguyen (2000) (Correct)
....insider corruption. 6.2.5 Secure multi party computation The problem of secure multi party computation arises in the following context: two or many parties want to determine some property about the pieces of information they hold while keeping them private. This was rst addressed by Andrew Yao [161] in 1982 with his famous Millionaire problem: Alice and Bob both hold an integer number; each one wants to know which one is greater without having to disclose to the other party his her number. The main results in the domain were achieved by Andrew Yao [162] in 1986 for the two party case and ....
Andrew C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symp. on Foundations of Comp. Science, pages 160-164, Chicago, 1982. IEEE.
Interleaving Cryptography and Mechanism Design: The Case of.. - Elkind, Lipmaa (2004) (Correct)
....that, when correctly followed by a honest party, ensure that certain well defined privacy correctness properties will be held w.r.t. her. In particular, a good auction scheme must ensure that neither a cheating auctioneer nor cheating bidders can make the auction non Pareto efficient. Andrew Yao [Yao82] was the first to consider cryptographic (English) auctions. The first cryptographically secure Vickrey auction scheme that provides losers privacy was proposed in [NS93] A large number of cryptographic Vickrey auction schemes have been proposed since that. See [NPS99,LAN02] for some examples ....
....signatures and the NISZK arguments. The bulletin board contents (that is, the tuple (CK (b 1 ) CK (b B ) X 1 ) together with the signatures and NISZK arguments) is stored. Alternatively, one can implement this mechanism by using Yao s model of general two party computation [Yao82]. This would involve the design a specific circuit that is suitable for this mechanism. Such an approach was successfully used by Naor, Pinkas and Sumner [NPS99] The LAN auction scheme is more efficient (especially when the number of bidders is large) while the Naor Pinkas Sumner scheme will not ....
Andrew Chi-Chih Yao. Protocols for Secure Computations (Extended Abstract). In 23rd Annual Symposium on Foundations of Computer Science, pages 160--164, Chicago, Illinois, USA, 3--5 November 1982. IEEE Computer Society Press.
Improved Non-Committing Encryption Schemes based on a.. - Damgård, Nielsen (2000) (12 citations) (Correct)
.... without the simulatability assumption, and without the common domain assumption of Canetti et al. In showing this last result, we identify and correct a bug in a key generation protocol from Canetti et al. 1 Introduction The problem of multiparty computation dates back to the papers by Yao [20] and Goldreich et al. 15] What was proved there was basically that a collection of n players can e#ciently compute the value of an n input function, such that everyone learns the correct result, but no other new information. More precisely, these protocols can be proved secure against a ....
Andrew C. Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science [16], pages 160--164.
Multiparty Computation from Threshold Homomorphic.. - Cramer, Damgård.. (2000) (27 citations) (Correct)
....Threshold decryption . 35 9.2.2 Proving you know a plaintext . 35 9.2.3 Proving multiplications correct . 37 ii 1 Introduction The problem of multiparty computation (MPC) dates back to the papers by Yao [18] and Goldreich et al. 12] What was proved there was basically that a collection of n players can e#ciently compute the value of an n input function, such that everyone learns the correct result, but no other new information. More precisely, these protocols can be proved secure against a ....
Andrew C. Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science [14], pages 160--164.
Cryptographically Private Support Vector Machines - Laur, Lipmaa, Mielikäinen (2006) (Correct)
No context found.
Andrew Chi-Chih Yao. Protocols for secure computations (extended abstract). In FOCS, pages 60--164, 1982.
An Asynchronous Multi-Party Computation Protocol - Martin Hirt Hirt (2004) (Correct)
No context found.
Andrew C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symposium on the Foundations of Computer Science (FOCS), pages 160--164. IEEE, 1982. 19
Secure Multi-Player Protocols: Fundamentals, Generality, and.. - Fehr (2003) (Correct)
No context found.
Andrew C. Yao. Protocols for secure computations. In 23rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 1982.
On Protocol Security in the Cryptographic Model - Nielsen (2003) (1 citation) (Correct)
No context found.
Andrew Chi-Chih Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, pages 160--164, Chicago, Illinois, 3--5 November 1982. IEEE.
An Efficient Scheme for Preserving Confidentiality in.. - Li, Lu, Shi (2004) (Correct)
No context found.
Andrew C. Yao. Protocols for secure computations. In Proceedings of the 23rd IEEE Annual Symposium on Foundations of Computer Science,November
Towards Secure Privacy Preserving Data Mining Over.. - Ahmad, Khokhar (2003) (Correct)
No context found.
Andrew C-C Yao, "Protocols for secure computations", FOCS 1982.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC