Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Skip header Section
Efficient Secure Two-Party Protocols: Techniques and ConstructionsNovember 2010
Publisher:
  • Springer-Verlag
  • Berlin, Heidelberg
ISBN:978-3-642-14302-1
Published:03 November 2010
Pages:
265
Skip Bibliometrics Section
Reflects downloads up to 15 Oct 2024Bibliometrics
Skip Abstract Section
Abstract

The authors present a comprehensive study of efficient protocols and techniques for secure two-party computation both general constructions that can be used to securely compute any functionality, and protocols for specific problems of interest. The book focuses on techniques for constructing efficient protocols and proving them secure. In addition, the authors study different definitional paradigms and compare the efficiency of protocols achieved under these different definitions.The book opens with a general introduction to secure computation and then presents definitions of security for a number of different adversary models and definitional paradigms. In the second part, the book shows how any functionality can be securely computed in an efficient way in the presence of semi-honest, malicious and covert adversaries. These general constructions provide a basis for understanding the feasibility of secure computation, and they are a good introduction to design paradigms and proof techniques for efficient protocols. In the final part, the book presents specific constructions of importance. The authors begin with an in-depth study of sigma protocols and zero knowledge, focusing on secure computation, and they then provide a comprehensive study of the fundamental oblivious transfer function. Starting from protocols that achieve privacy only, they show highly efficient constructions that achieve security in the presence of malicious adversaries for both a single and multiple batch executions. Oblivious pseudorandom function evaluation is then presented as an immediate application of oblivious transfer. Finally, the book concludes with two examples of high-level protocol problems that demonstrate how specific properties of a problem can be exploited to gain high efficiency: securely computing the kth-ranked element, and secure database and text search. This book is essential for practitioners and researchers in the field of secure protocols, particularly those with a focus on efficiency, and for researchers in the area of privacy-preserving data mining. This book can also be used as a textbook for an advanced course on secure protocols.This book is essential for practitioners and researchers in the field of secure protocols, particularly those with a focus on efficiency, and for researchers in the area of privacy-preserving data mining. This book can also be used as a textbook for an advanced course on secure protocols.This book is essential for practitioners and researchers in the field of secure protocols, particularly those with a focus on efficiency, and for researchers in the area of privacy-preserving data mining. This book can also be used as a textbook for an advanced course on secure protocols.

Cited By

  1. ACM
    Mann Z, Weinert C, Chabal D and Bos J (2023). Towards Practical Secure Neural Network Inference: The Journey So Far and the Road Ahead, ACM Computing Surveys, 56:5, (1-37), Online publication date: 31-May-2024.
  2. ACM
    Lu Y, Yu Z and Suri N (2023). Privacy-preserving Decentralized Federated Learning over Time-varying Communication Graph, ACM Transactions on Privacy and Security, 26:3, (1-39), Online publication date: 30-Aug-2023.
  3. ACM
    Akavia A, Leibovich M, Resheff Y, Ron R, Shahar M and Vald M (2022). Privacy-Preserving Decision Trees Training and Prediction, ACM Transactions on Privacy and Security, 25:3, (1-30), Online publication date: 31-Aug-2022.
  4. ACM
    Chau S and Zhou Y Blockchain-enabled decentralized privacy-preserving group purchasing for retail energy plans Proceedings of the Thirteenth ACM International Conference on Future Energy Systems, (172-187)
  5. ACM
    Ye Q and Delaware B (2022). Oblivious algebraic data types, Proceedings of the ACM on Programming Languages, 6:POPL, (1-29), Online publication date: 16-Jan-2022.
  6. Bashar G, Holmes J and Dagher G (2022). ACCORD: A Scalable Multileader Consensus Protocol for Healthcare Blockchain, IEEE Transactions on Information Forensics and Security, 17, (2990-3005), Online publication date: 1-Jan-2022.
  7. ACM
    Wang N, Chau S and Zhou Y (2022). Privacy-preserving energy storage sharing with blockchain and secure multi-party computation, ACM SIGEnergy Energy Informatics Review, 1:1, (32-50), Online publication date: 1-Nov-2021.
  8. ACM
    Wang N, Chau S and Zhou Y Privacy-Preserving Energy Storage Sharing with Blockchain Proceedings of the Twelfth ACM International Conference on Future Energy Systems, (185-198)
  9. Chalkias K, Garillot F, Kondi Y and Nikolaenko V Non-interactive Half-Aggregation of EdDSA and Variants of Schnorr Signatures Topics in Cryptology – CT-RSA 2021, (577-608)
  10. ACM
    Abascal J, Faghihi Sereshgi M, Hazay C, Ishai Y and Venkitasubramaniam M Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, (1591-1605)
  11. Ciampi M, Parisella R and Venturi D On Adaptive Security of Delayed-Input Sigma Protocols and Fiat-Shamir NIZKs Security and Cryptography for Networks, (670-690)
  12. Damgård I, Orlandi C and Simkin M Black-Box Transformations from Passive to Covert Security with Public Verifiability Advances in Cryptology – CRYPTO 2020, (647-676)
  13. Aranha D, Orlandi C, Takahashi A and Zaverucha G Security of Hedged Fiat–Shamir Signatures Under Fault Attacks Advances in Cryptology – EUROCRYPT 2020, (644-674)
  14. Li L, Liu J, Jia P and Cimato S (2020). SPCTR, Security and Communication Networks, 2020, Online publication date: 1-Jan-2020.
  15. Shamsabadi A, Gascón A, Haddadi H and Cavallaro A (2020). PrivEdge: From Local to Distributed Private Training and Prediction, IEEE Transactions on Information Forensics and Security, 15, (3819-3831), Online publication date: 1-Jan-2020.
  16. ACM
    Hazay C, Ishai Y, Marcedone A and Venkitasubramaniam M LevioSA Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (327-344)
  17. ACM
    Karakoç F, Nateghizad M and Erkin Z SET-OT Proceedings of the 14th International Conference on Availability, Reliability and Security, (1-9)
  18. Samadani M, Berenjkoob M and Blanton M (2019). Secure pattern matching based on bit parallelism, International Journal of Information Security, 18:3, (371-391), Online publication date: 1-Jun-2019.
  19. Chen Z, Che R, Zhong H, Tian M and Cui J (2019). PATH, Wireless Networks, 25:4, (1763-1776), Online publication date: 1-May-2019.
  20. Wang Q, Huang J, Chen Y, Tian X and Zhang Q (2019). Privacy-Preserving and Truthful Double Auction for Heterogeneous Spectrum, IEEE/ACM Transactions on Networking, 27:2, (848-861), Online publication date: 1-Apr-2019.
  21. Hazay C, Mikkelsen G, Rabin T, Toft T and Nicolosi A (2019). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting, Journal of Cryptology, 32:2, (265-323), Online publication date: 1-Apr-2019.
  22. Song Y, Wang H, Wei X, Wu L and Zhang M (2019). Efficient Attribute-Based Encryption with Privacy-Preserving Key Generation and Its Application in Industrial Cloud, Security and Communication Networks, 2019, Online publication date: 1-Jan-2019.
  23. ACM
    Lindell Y and Nof A Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, (1837-1854)
  24. Luo Y, Cheung S, Lazzeretti R, Pignata T and Barni M (2018). Anonymous subject identification and privacy information management in video surveillance, International Journal of Information Security, 17:3, (261-278), Online publication date: 1-Jun-2018.
  25. Hazay C, Ishai Y and Venkitasubramaniam M Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model Theory of Cryptography, (3-39)
  26. Harris W, Jha S, Reps T and Seshia S (2017). Program synthesis for interactive-security systems, Formal Methods in System Design, 51:2, (362-394), Online publication date: 1-Nov-2017.
  27. Mahdi M, Hasan M and Mohammed N Secure sequence similarity search on encrypted genomic data Proceedings of the Second IEEE/ACM International Conference on Connected Health: Applications, Systems and Engineering Technologies, (205-213)
  28. Wang Z, Cheung S and Luo Y (2017). Information-Theoretic Secure Multi-Party Computation With Collusion Deterrence, IEEE Transactions on Information Forensics and Security, 12:4, (980-995), Online publication date: 1-Apr-2017.
  29. ACM
    Kim H, Shin Y, Kim H and Chang J Efficient and secure top-k query processing algorithm using garbled circuit based secure protocols on outsourced databases Proceedings of the Sixth International Conference on Emerging Databases: Technologies, Applications, and Theory, (124-134)
  30. Carter H, Mood B, Traynor P and Butler K (2016). Outsourcing secure two-party computation as a black box, Security and Communication Networks, 9:14, (2261-2275), Online publication date: 25-Sep-2016.
  31. Moran T, Naor M and Segev G (2016). An Optimally Fair Coin Toss, Journal of Cryptology, 29:3, (491-513), Online publication date: 1-Jul-2016.
  32. Ciampi M, Persiano G, Scafuro A, Siniscalchi L and Visconti I Online/Offline OR Composition of Sigma Protocols Proceedings, Part II, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 9666, (63-92)
  33. Bai G, Damgård I, Orlandi C and Xia Y Non-Interactive Verifiable Secret Sharing for Monotone Circuits Proceedings of the 8th International Conference on Progress in Cryptology --- AFRICACRYPT 2016 - Volume 9646, (225-244)
  34. Lindell Y (2016). Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries, Journal of Cryptology, 29:2, (456-490), Online publication date: 1-Apr-2016.
  35. Gennaro R, Hazay C and Sorensen J (2016). Automata Evaluation and Text Search Protocols with Simulation-Based Security, Journal of Cryptology, 29:2, (243-282), Online publication date: 1-Apr-2016.
  36. Ferradi H, Géraud R and Naccache D Slow Motion Zero Knowledge Identifying with Colliding Commitments Revised Selected Papers of the 11th International Conference on Information Security and Cryptology - Volume 9589, (381-396)
  37. ACM
    Dagher G, Bünz B, Bonneau J, Clark J and Boneh D Provisions Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, (720-731)
  38. ACM
    Liu J, Asokan N and Pinkas B Secure Deduplication of Encrypted Data without Additional Independent Servers Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, (874-885)
  39. Chou T and Orlandi C The Simplest Protocol for Oblivious Transfer Proceedings of the 4th International Conference on Progress in Cryptology -- LATINCRYPT 2015 - Volume 9230, (40-58)
  40. Buescher N and Katzenbeisser S Faster secure computation through automatic parallelization Proceedings of the 24th USENIX Conference on Security Symposium, (531-546)
  41. Huang H, Gong T, Chen P, Qiu G and Wang R (2015). Secure two-party distance computation protocols with a semihonest third party and randomization for privacy protection in wireless sensor networks, International Journal of Distributed Sensor Networks, 2015, (2-2), Online publication date: 1-Jan-2015.
  42. ACM
    Jakobsen T, Nielsen J and Orlandi C A Framework for Outsourcing of Secure Computation Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, (81-92)
  43. Roy P and Adhikari A (2014). One-sided leakage-resilient privacy only two-message oblivious transfer, Journal of Information Security and Applications, 19:4, (295-300), Online publication date: 1-Nov-2014.
  44. ACM
    Bringer J, Chabanne H, Favre M, Patey A, Schneider T and Zohner M GSHADE Proceedings of the 2nd ACM workshop on Information hiding and multimedia security, (187-198)
  45. ACM
    Jarrous A and Pinkas B Canon-MPC, a system for casual non-interactive secure multi-party computation using native client Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society, (155-166)
  46. ACM
    Katti R, Sule R and Kavasseri R Multicast authentication in the smart grid with one-time signatures from sigma-protocols Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems, (239-239)
  47. Kolesnikov V, Sadeghi A and Schneider T (2013). A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design, Journal of Computer Security, 21:2, (283-315), Online publication date: 1-Mar-2013.
  48. Asharov G and Orlandi C Calling out cheaters Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security, (681-698)
  49. Higo H, Tanaka K, Yamada A and Yasunaga K A game-theoretic perspective on oblivious transfer Proceedings of the 17th Australasian conference on Information Security and Privacy, (29-42)
  50. Scafuro A and Visconti I On round-optimal zero knowledge in the bare public-key model Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques, (153-171)
  51. Huang Y, Evans D, Katz J and Malka L Faster secure two-party computation using garbled circuits Proceedings of the 20th USENIX conference on Security, (35-35)
  52. Vergnaud D Efficient and secure generalized pattern matching via fast fourier transform Proceedings of the 4th international conference on Progress in cryptology in Africa, (41-58)
  53. Lindell Y Highly-efficient universally-composable commitments based on the DDH assumption Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology, (446-466)
  54. Wang Z and Cheung S On privacy preference in collusion-deterrence games for secure multi-party computation 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), (2044-2048)
Contributors
  • Bar-Ilan University
  • Bar-Ilan University

Recommendations