Method and system for mediated secure computation

Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular node for directing data and applying cryptography

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C713S171000, C713S169000, C713S170000, C713S189000, C380S046000, C380S278000, C705S050000, C705S080000

Reexamination Certificate

active

08010782

ABSTRACT:
Techniques are described for mediated secure computation. A unique identifier value may be assigned to each one of a plurality of nodes included in a network. An encrypted portion of a logical circuit may be received at a server from each of the nodes, the logical circuit including one or more gates, each gate associated with one or more logical input wires and one or more logical output wires, the logical circuit associated with a function, wherein each encrypted portion is encrypted based on a random number value that is common to the plurality of nodes and unknown at the server. A result may be obtained based on executing the logical circuit, based on combining the encrypted portions of the logical circuit received at the server.

REFERENCES:
patent: 5799090 (1998-08-01), Angert
patent: 6115471 (2000-09-01), Oki et al.
patent: 6957341 (2005-10-01), Rice et al.
patent: 7240198 (2007-07-01), Pinkas et al.
patent: 7346160 (2008-03-01), Michaelsen
patent: 7386878 (2008-06-01), Fernando et al.
patent: 7697693 (2010-04-01), Elliott
patent: 7711616 (2010-05-01), Knapp
patent: 2003/0046198 (2003-03-01), Knapp et al.
patent: 2003/0074330 (2003-04-01), Asokan et al.
patent: 2003/0233328 (2003-12-01), Scott et al.
patent: 2005/0201555 (2005-09-01), Yen et al.
patent: 2007/0245403 (2007-10-01), Ginter et al.
patent: 2007/0294432 (2007-12-01), Takase et al.
patent: 2009/0140767 (2009-06-01), Kolesnikov et al.
patent: 2009/0187978 (2009-07-01), Upendran et al.
Satoshi Koga, et al. “Enhancing Security of Security-Mediated PKI by One-time ID”, 4th Annual PKI R&D Workshop: Multiple Paths to Trust, Apr. 19-21, 2005, NIST, Gaithersburg MD.
Dahlia Malkhi, et al., “Fairplay—A Secure Two-Party Computation System”, Usenix Security Symposium, San Diego, CA, Aug. 2004.
M. Atallah, et al. “Private Collaborative Forecasting and Benchmarking”, In Proceedings of 3rd ACM Workshop on Privacy in the Electronic Society (WPES), pp. 103-114, Washington D.C., Oct. 2004.
D. Beaver, et al., “The Round Complexity of Secure Protocols”, Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990.
P. Bogetoft, et al., “A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation”, Proceedings of Financial Cryptography, 2006.
C. Cachin, “Efficient Private Bidding and Auctions with an Oblivious Third Party”, Proceedings of the 6th ACM Conference on Computer and Communications Security, 1999.
G. Di Crescenzo, “Private Selective Payment Protocols”, Proceedings of Financial Cryptography, 2000.
G. Di Crescenzo, “Privacy for the Stock Market”, Proceedings of Financial Cryptography, 2001.
J. Feigenbaum, et al., “Sharing the Cost of Multicast Transmissions”, Journal of Computer and System Sciences 63 (2001), pp. 21-41.
J. Feigenbaum, et al. “Secure Computation of Surveys”, Proceedings of the EU Workshop on Secure Multiparty Protocols, 2004.
J. Feigenbaum, et al. “Distributed Algorithmic Mechanism Design: Recent Results and Future Directions”, Bulletin of the EATCS 79, 2003.
O. Goldreich, “Secure Multi-party Computation” www.wisdom.weizmann.ac.il˜oded/pp.html, 2002.
J. Halpern, et al. “Rational Secret Sharing and Multiparty Computation: Extended Abstract”, Proceedings of the 36th ACM Symposium on Theory of Computing, 2004.
M. Harkavy, et al., “Electronic Auctions with Private Bids”, Proceedings of 3rd USENIX Workshop on Electronic Commerce, 1998.
M. Hirt, et al., “Efficient Secure Multi-Party Computation” (Extended Abstract), Proceedings of Asiacrypt, 2000.
S. Izmalkov, et al., “Rational Secure Computation and Ideal Mechanism Design”, Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, 2005.
A. Juels, et al., “A two-server, sealed-bid auction protocol”, Proceedings of the 6th Conference on Financial Cryptography, 2002.
Y. Lindell, et al., “A Proof of Yao's Protocol for Secure Two-Party Computation”, Electronic Colloquium on Computational Complexity 11, 2004.
M. Naor, et al., “Privacy Preserving Auctions and Mechanism Design”, Proceedings of the 1st ACM Conference on Electronic Commerce, 1999.
S. Pohlig, et al., “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance”, IEEE Transactions on Information Theory 24, 1978.
Y. Shoham, et al., “Non-Cooperative Computation: boolean functions with correctness and exclusivity”, Theoretical Computer Science 343(1-2), 2005.
A. Yao, “Protocols for Secure Computations” Proceedings of the annual IEEE Symposium on Foundations of Computer Science 23, 1982.
Naor, M. et al., “Privacy Preserving Auctions and Mechanism Design”, Proceedings of the 1st ACM conference on Electronic commerce, Denver, Colorado, U.S., Jan. 1, 1999, pp. 129-139.
Brandt, F., “How to obtain full privacy in auctions”, International Journal of information Security, vol. 5, No. 4, Mar. 31, 2006, pp. 201-216.
Yao, A. C., “Protocols for secure computations”, Annual symposium on Foundations of Computer science, Jan. 1, 1982, pp. 160-164.
European Search Report Received for EP Patent Application No. 09000593.5-2415, mailed on Jun. 5, 2009, 5 pages.
Communication Pursuant to Rule 69 EPC for European Patent Application No. 09000593.5, mailed on Jul. 24, 2009, 2 pages.
Office Action Response for European Patent Application No. 09000593.5, filed on Jul. 27, 2009, 15 pages.
Office Action for European Patent Application No. 09000593.5, mailed on Apr. 6, 2010, 2 pages.
Office Action Response for European Patent Application No. 09000593.5, filed on Apr. 30, 2010, 14 pages.
Communication under Rule 71(3) EPC for European Patent Application No. 09000593.5, mailed on Jun. 25, 2010, 72 pages.
Notice of Decision to Grant European Patent for European Patent Application No. 09000593.5, mailed on Sep. 30, 2010, 2 pages.
Response to Communication under Rule 71(3) EPC for European Patent Application No. 09000593.5, filed on Sep. 17, 2010, 25 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and system for mediated secure computation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system for mediated secure computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for mediated secure computation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2646773

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.