SHADE: Secure HAmming DistancE Computation from Oblivious Transfer

Bringer, Julien; Chabanne, Hervé; Patey, Alain

doi:10.1007/978-3-642-41320-9_11

Cited by 40 publications

(57 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Securely computing these functions has applications in the signal processing and cryptographic domains, especially for privacy-preserving biometric recognition [SSW09,BCP13].…”

Section: The Settingmentioning

confidence: 99%

“…, z it ) We would like to point out that this protocol might not only have theoretical interest. For instance, the protocol of [BCP13] uses coding-like techniques and oblivious transfer only, and is one of the most efficient protocol for securely computing functions such as Hamming distances on binary vectors, outperforming protocols based on additively homomorphic cryptosystems or on garbled circuits. In the case of the protocol of this paper, performance will highly rely on the rate of the underlying code.…”

Section: Protocolmentioning

confidence: 99%

See 1 more Smart Citation

Towards Secure Two-Party Computation from the Wire-Tap Channel

Chabanne

Cohen

Patey

2014

Information Security and Cryptology -- ICISC 2013

Self Cite

View full text Add to dashboard Cite

We introduce a new protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. We first establish a parallel between the second version of the wire-tap channel model and secure two-party computation. This leads us to our protocol, that combines linear coset coding and oblivious transfer techniques. Our construction requires the use of binary intersecting codes or q-ary minimal codes, which are also studied in this paper.

show abstract

“…Securely computing these functions has applications in the signal processing and cryptographic domains, especially for privacy-preserving biometric recognition [SSW09,BCP13].…”

Section: The Settingmentioning

confidence: 99%

Section: Protocolmentioning

confidence: 99%

Towards Secure Two-Party Computation from the Wire-Tap Channel

Chabanne

Cohen

Patey

2014

Information Security and Cryptology -- ICISC 2013

Self Cite

View full text Add to dashboard Cite

show abstract

“…It is also one of the major computational overhead for Yao's garbled circuit protocols [23,29]. OTs are also used in many applications like biometric authentication, e-auctions, private information retrieval, and private search [30][31][32][33]. Hence, the overall complexity for mobile environment and resource-constrained devices can be enhanced by outsourcing OT securely.…”

Section: Our Contributionsmentioning

confidence: 99%

“…Namely, clients only need to randomize/encrypt their data and de-randomize/decrypt the returned messages to get the desired results. OT is one of the major computational overhead for Yao's garbled circuit protocol [23,29], and used in several applications like biometric authentication, e-auctions, private information retrieval, private search [30][31][32][33]. Hence, running OT protocols for resourceconstrained mobile environment may have substantial benefits.…”

Section: Oblivious Transfermentioning

confidence: 99%

Efficient and verifiable algorithms for secure outsourcing of cryptographic computations

Kiraz

Uzunkol

2015

Int. J. Inf. Secur.

View full text Add to dashboard Cite

Reducing computational cost of cryptographic computations for resource-constrained devices is an active research area. One of the practical solutions is to securely outsource the computations to an external and more powerful cloud server. Modular exponentiations are the most expensive computation from the cryptographic point of view. Therefore, outsourcing modular exponentiations to a single, external and potentially untrusted cloud server while ensuring the security and privacy provide an efficient solution. In this paper, we propose new efficient outsourcing algorithms for modular exponentiations using only one untrusted cloud server. These algorithms cover public-base & private-exponent, private-base & public-exponent, private-base & privateexponent, and more generally private-base & private-exponents simultaneous modular exponentiations. Our algorithms are the most efficient solutions utilizing only one single untrusted server with best checkability probabilities. Furthermore, unlike existing schemes, which have fixed checkability probability, our algorithms provide adjustable predetermined checkability parameters. Finally, we apply our algorithms to outsource Oblivious Transfer Protocols and Blind Signatures which are expensive primitives in modern cryptography.

show abstract

“…In most of these schemes, biometric templates are extracted as bitstrings and the similarity of two biometric templates is measured by computing the Hamming distance between them. For this reason, in [24] the authors have proposed protocols for secure Hamming distance computation based on oblivious transfer. These have potential applications in privacy-preserving biometric authentication.…”

Section: Introductionmentioning

confidence: 99%

Efficient Verifiable Computation of XOR for Biometric Authentication

Abidin

Aly

Rúa

et al. 2016

Cryptology and Network Security

View full text Add to dashboard Cite

Abstract. This work addresses the security and privacy issues in remote biometric authentication by proposing an efficient mechanism to verify the correctness of the outsourced computation in such protocols. In particular, we propose an efficient verifiable computation of XORing encrypted messages using an XOR linear message authentication code (MAC) and we employ the proposed scheme to build a biometric authentication protocol. The proposed authentication protocol is both secure and privacy-preserving against malicious (as opposed to honestbut-curious) adversaries. Specifically, the use of the verifiable computation scheme together with an homomorphic encryption protects the privacy of biometric templates against malicious adversaries. Furthermore, in order to achieve unlinkability of authentication attempts, while keeping a low communication overhead, we show how to apply Oblivious RAM and biohashing to our protocol. We also provide a proof of security for the proposed solution. Our simulation results show that the proposed authentication protocol is efficient.

show abstract

SHADE: Secure HAmming DistancE Computation from Oblivious Transfer

Cited by 40 publications

References 37 publications

Towards Secure Two-Party Computation from the Wire-Tap Channel

Towards Secure Two-Party Computation from the Wire-Tap Channel

Efficient and verifiable algorithms for secure outsourcing of cryptographic computations

Efficient Verifiable Computation of XOR for Biometric Authentication

Contact Info

Product

Resources

About