Loading...

Secure two-party computation using an efficient garbled circuit by reducing data transfer

Yalame, M. H ; Sharif University of Technology | 2017

726 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-981-10-5421-1_3
  3. Publisher: Springer Verlag , 2017
  4. Abstract:
  5. Secure computation has obtained significant attention in the literature recently. Classic architectures usually use either the Garbled Circuit (GC) or the Goldreich-Micali-Wigderson (GMW) protocols. So far, to reduce the complexity of communications in these protocols, various methods have been proposed. The best known work in both methods reduces the communication up to almost 2k-bits (k is the symmetric security parameter) for each AND gate, and using XOR gate is free. In this paper, by combining GC and GMW, we propose a scheme in the semi-honest adversary model. This scheme requires an Oblivious Transfer (OT) and a 2-bit data transfer for each AND gate, keeping XOR gates free. The analytical results on different applications, including AES, DES, SHA-1, SHA-256, MD5, multiplier, adder, and comparator show that the data transfer size can be reduced up to 52% and 41% when compared to the best known GC and GMW based methods, respectively. © Springer Nature Singapore Pte Ltd. 2017
  6. Keywords:
  7. Garbled circuit protocol ; GMW protocol ; Oblivious transfer protocol ; Secure computation ; Cryptography ; Data transfer ; Network architecture ; Security of data ; Timing circuits ; Analytical results ; Garbled circuits ; Oblivious transfer protocols ; Secure function evaluation ; Secure two-party computations ; Security parameters ; Semi-honest adversaries ; Data reduction
  8. Source: 8th International Conference on Applications and Techniques in Information Security, ATIS 2017, 6 July 2017 through 7 July 2017 ; Volume 719 , 2017 , Pages 23-34 ; 18650929 (ISSN); 9789811054204 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/978-981-10-5421-1_3