Julien Bringer
ABSTRACT
The secure two-party computation (S2PC) protocols SHADE and GSHADE have been introduced by Bringer et al. in the last two years. The protocol GSHADE permits to compute different distances (Hamming, Euclidean, Mahalanobis) quite efficiently and is one of the most efficient compared to other S2PC methods. Thus this protocol can be used to efficiently compute one-to-many identification for several biometrics data (iris, face, fingerprint).
In this paper, we introduce two extensions of GSHADE. The first one enables us to evaluate new multiplicative functions. This way, we show how to apply GSHADE to a classical machine learning algorithm. The second one is a new proposal to secure GSHADE against malicious adversaries following the recent dual execution and cut-and-choose strategies. The additional cost is very small. By preserving the GSHADE's structure, our extensions are very efficient compared to other S2PC methods.
- G. Asharov, Y. Lindell, T. Schneider, and M. Zohner. More efficient oblivious transfer and extensions for faster secure computation. In ACM SIGSAC Conference on Computer and Communications Security, CCS'13, 2013. Google Scholar
Digital Library
- G. Asharov, Y. Lindell, T. Schneider, and M. Zohner. More efficient oblivious transfer extensions with security for malicious adversaries. In Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2015.Google Scholar
- S. Avidan, A. Elbaz, and T. Malkin. Privacy preserving pattern classification. In Proceedings of the International Conference on Image Processing, ICIP, 2008.Google ScholarCross Ref
- F. Benhamouda, G. Couteau, D. Pointcheval, and H. Wee. Implicit zero-knowledge arguments and applications to the malicious setting. In Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, 2015.Google Scholar
- R. Bost, R. A. Popa, S. Tu, and S. Goldwasser. Machine learning classification over encrypted data. In 22nd Annual Network and Distributed System Security Symposium, NDSS, 2015.Google ScholarCross Ref
- J. Bringer, H. Chabanne, M. Favre, A. Patey, T. Schneider, and M. Zohner. GSHADE: faster privacy-preserving distance computation and biometric identification. In ACM Information Hiding and Multimedia Security Workshop, IH&MMSec, 2014. Google ScholarDigital Library
- J. Bringer, H. Chabanne, and A. Patey. SHADE: secure hamming distance computation from oblivious transfer. In Financial Cryptography and Data Security - FC 2013 Workshops, USEC and WAHC, 2013.Google ScholarCross Ref
- C. Cortes and V. Vapnik. Support-vector networks. Machine Learning, 20(3), 1995. Google ScholarDigital Library
- I. Damgård, M. Keller, E. Larraia, V. Pastro, P. Scholl, and N. P. Smart. Practical covertly secure MPC for dishonest majority - or: Breaking the SPDZ limits. In Computer Security - ESORICS 2013 - 18th European Symposium on Research in Computer Security, 2013.Google Scholar
- I. Damgård, V. Pastro, N. P. Smart, and S. Zakarias. Multiparty computation from somewhat homomorphic encryption. In Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, 2012. Google ScholarDigital Library
- Z. Erkin, T. Veugen, and R. L. Lagendijk. Privacy-preserving recommender systems in dynamic environments. In 2013 IEEE International Workshop on Information Forensics and Security, WIFS, 2013.Google ScholarCross Ref
- C. Gentry. A fully homomorphic encryption scheme. PhD thesis, Stanford University, 2009. Google ScholarDigital Library
- O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or A completeness theorem for protocols with honest majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987. Google ScholarDigital Library
- Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In 20th USENIX Security Symposium, 2011. Google ScholarDigital Library
- Y. Huang, J. Katz, and D. Evans. Quid-pro-quo-tocols: Strengthening semi-honest protocols with dual execution. In IEEE Symposium on Security and Privacy, SP, 2012. Google ScholarDigital Library
- Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, 2003.Google Scholar
- M. Keller, E. Orsini, and P. Scholl. Actively secure OT extension with optimal overhead. IACR Cryptology ePrint Archive, 2015.Google Scholar
- M. S. Kiraz, Z. A. Genç, and S. Kardas. Security and efficiency analysis of the hamming distance computation protocol based on oblivious transfer. IACR Cryptology ePrint Archive, 2014.Google Scholar
- V. Kolesnikov and T. Schneider. Improved garbled circuit: Free XOR gates and applications. In Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, 2008. Google ScholarDigital Library
- Y. Lindell and B. Pinkas. An efficient protocol for secure two-party computation in the presence of malicious adversaries. In Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2007. Google ScholarDigital Library
- M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001. Google ScholarDigital Library
- M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In EC, 1999. Google ScholarDigital Library
- J. B. Nielsen. Extending oblivious transfers efficiently - how to get robustness almost for free. IACR Cryptology ePrint Archive, 2007.Google Scholar
- V. Nikolaenko, S. Ioannidis, U. Weinsberg, M. Joye, N. Taft, and D. Boneh. Privacy-preserving matrix factorization. In ACM SIGSAC Conference on Computer and Communications Security, CCS'13, 2013. Google ScholarDigital Library
- P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology - EUROCRYPT '99, International Conference on the Theory and Application of Cryptographic Techniques, 1999. Google ScholarDigital Library
- B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams. Secure two-party computation is practical. In Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, 2009. Google ScholarDigital Library
- M. O. Rabin. How to exchange secrets with oblivious transfer. Harvard University Technical Report 81, 1981.Google Scholar
- Y. Rahulamathavan, S. Veluru, R. C. Phan, J. A. Chambers, and M. Rajarajan. Privacy-preserving clinical decision support system using gaussian kernel-based classification. IEEE J. Biomedical and Health Informatics, 18, 2014.Google Scholar
- M. Upmanyu, A. M. Namboodiri, K. Srinathan, and C. V. Jawahar. Blind authentication: a secure crypto-biometric verification protocol. IEEE Transactions on Information Forensics and Security, 2010. Google ScholarDigital Library
- D. J. Wu, T. Feng, M. Naehrig, and K. E. Lauter. Privately evaluating decision trees and random forests. IACR Cryptology ePrint Archive, 2015.Google Scholar
- A. C. Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, 1982. Google ScholarDigital Library
- A. C. Yao. How to generate and exchange secrets (extended abstract). In 27th Annual Symposium on Foundations of Computer Science, 1986. Google ScholarDigital Library
Index Terms
- Boosting GSHADE Capabilities: New Applications and Security in Malicious Setting
Recommendations
GSHADE: faster privacy-preserving distance computation and biometric identification
IH&MMSec '14: Proceedings of the 2nd ACM workshop on Information hiding and multimedia securityAt WAHC'13, Bringer et al. introduced a protocol called SHADE for secure and efficient Hamming distance computation using oblivious transfer only. In this paper, we introduce a generalization of the SHADE protocol, called GSHADE, that enables privacy-...
A Proof of Security of Yao’s Protocol for Two-Party Computation
In the mid 1980s, Yao presented a constant-round protocol for securely computing any two-party functionality in the presence of semi-honest adversaries (FOCS 1986). In this paper, we provide a complete description of Yao’s protocol, along with a ...
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Protocols for secure two-party computation enable a pair of parties to compute a function of their inputs while preserving security properties such as privacy, correctness and independence of inputs. Recently, a number of protocols have been proposed ...
Comments