A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design

作者: Vladimir Kolesnikov , Ahmad-Reza Sadeghi , Thomas Schneider

DOI: 10.3233/JCS-130464

关键词:

摘要: General two-party Secure Function Evaluation SFE allows mutually distrusting parties to correctly compute any function on their private input data, without revealing the inputs. Two-party can benefit almost client-server interaction where privacy is required, such as privacy-preserving credit checking, medical classification, or face recognition. Today, a subject of immense amount research in variety directions and not easy navigate.In this article, we systematize most practically important works vast knowledge general SFE. We argue that many cases efficient protocols are obtained by combining several basic techniques, e.g., garbled circuits additively homomorphic encryption.As valuable methodological contribution, present framework which today's techniques for be viewed building blocks with well-defined interfaces easily combined into complete solution. Further, our approach naturally automated protocol generation compilation has been implemented partially TASTY framework.In summary, provide comprehensive guide state-of-the-art SFE, additional goal extracting, systematizing unifying relevant promising techniques. Our target audience graduate students wishing enter field advanced engineers seeking develop solutions. hope paints high-level picture field, including common approaches trade-offs gives precise numerous pointers formal treatment its specific aspects.

参考文章(125)
Kimmo Järvinen, Vladimir Kolesnikov, Ahmad-Reza Sadeghi, Thomas Schneider, Efficient Secure Two-Party Computation with Untrusted Hardware Tokens (Full Version)* Information Security and Cryptography. pp. 367- 386 ,(2010) , 10.1007/978-3-642-14452-3_17
Craig Gentry, Shai Halevi, Implementing Gentry's fully-homomorphic encryption scheme international cryptology conference. pp. 129- 148 ,(2011) , 10.1007/978-3-642-20465-4_9
Benjamin Kreuter, Abhi Shelat, Chih-Hao Shen, Billion-gate secure computation with malicious adversaries usenix security symposium. pp. 14- 14 ,(2012)
Jonathan Katz, Lior Malka, Constant-Round private function evaluation with linear complexity international conference on the theory and application of cryptology and information security. pp. 556- 571 ,(2011) , 10.1007/978-3-642-25385-0_30
Dan Bogdanov, Riivo Talviste, Jan Willemson, Deploying Secure Multi-Party Computation for Financial Data Analysis financial cryptography. pp. 57- 64 ,(2012) , 10.1007/978-3-642-32946-3_5
Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank, Extending Oblivious Transfers Efficiently Advances in Cryptology - CRYPTO 2003. pp. 145- 161 ,(2003) , 10.1007/978-3-540-45146-4_9
Zekeriya Erkin, Martin Franz, Jorge Guajardo, Stefan Katzenbeisser, Inald Lagendijk, Tomas Toft, None, Privacy-Preserving Face Recognition privacy enhancing technologies. pp. 235- 253 ,(2009) , 10.1007/978-3-642-03168-7_14
Benjamin Mood, Lara Letaw, Kevin Butler, Memory-Efficient Garbled Circuit Generation for Mobile Devices financial cryptography. pp. 254- 268 ,(2012) , 10.1007/978-3-642-32946-3_19