A correction to 'efficient and secure comparison for on-line auctions'

Damgård, Ivan; Geisler, Martin; Kroigard, Mikkel

doi:10.1504/ijact.2009.028031

Cited by 78 publications

(91 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It can be instantiated with a variety of cryptosystems including [Pai99,DJ01], or the cryptosystem of [DGK07,DGK08b,DGK08a] which is restricted to small plaintext space P -just to name a few.…”

Section: Homomorphic Encryption (He)mentioning

confidence: 99%

“…The auction system proposed in [DGK07,DGK08a,DGK08b] extends the idea of splitting the computation of the auction function between two parties, the auctioneer (called server) and another party (called assisting server) who are assumed not to collude. Each bidder can submit a maximum bid b which he secret-shares between server and assisting server over respective secure channels.…”

Section: First-price Auctionsmentioning

confidence: 99%

“…The comparison protocol of [BK04] uses bitwise Paillier encryption and has communication complexity 4 T . This protocol was improved in [DGK07,DGK08b,DGK08a] to communication complexity 2 T by using a new homomorphic encryption scheme with smaller ciphertext size. These two-party protocols were extended to comparisons in the multi-party setting with logarithmic and linear round complexity in [GSV07].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima

Kolesnikov¹,

Sadeghi

Schneider

2009

Cryptology and Network Security

194

183

View full text Add to dashboard Cite

Abstract. We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for addition, subtraction, multiplication, and comparison functions. Our circuits for subtraction and comparison are approximately two times smaller (in terms of garbled tables) than previous constructions. This implies corresponding computation and communication improvements in SFE of functions using our efficient building blocks. The techniques rely on recently proposed "free XOR" GC technique. Further, we present concrete and detailed improved GC protocols for the problem of secure integer comparison, and related problems of auctions, minimum selection, and minimal distance. Performance improvement comes both from building on our efficient basic blocks and several problemspecific GC optimizations. We provide precise cost evaluation of our constructions, which serves as a baseline for future protocols.

show abstract

Section: Homomorphic Encryption (He)mentioning

confidence: 99%

Section: First-price Auctionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima

Kolesnikov¹,

Sadeghi

Schneider

2009

Cryptology and Network Security

194

183

View full text Add to dashboard Cite

show abstract

“…The first one is the cryptosystem by Damgård, Geisler and Krøigaard (DGK) [1], [15] that is dedicated to small plaintexts and fits nicely within the secure comparison protocol. The public key is (n, g, h, u) and the private key is (p, q, v p , v q ) such that the cipher text modulus n is the product of two large primes p en q.…”

Section: B Preliminariesmentioning

confidence: 99%

“…The numbers g and h are elements of Z * n of order uv p v q and v p v q respectively. The reasoning behind the values of all these parameters is explained in [15].…”

Section: B Preliminariesmentioning

confidence: 99%

Improving the DGK comparison protocol

Veugen

2012

2012 IEEE International Workshop on Information Forensics and Security (WIFS)

View full text Add to dashboard Cite

Abstract-When processing signals in the encrypted domain, homomorphic encryption can be used to enable linear operations on encrypted data. Comparison of encrypted data however requires an additional protocol between the parties and will be relatively expensive. A well-known and frequently used comparison protocol is by Damgård, Geisler and Krøigaard. We present two ways of improving this comparison protocol. Firstly, we reduce the computational effort of one party by roughly 50%. Secondly, we show how to achieve perfect security towards the other party without additional costs, whereas the original version with encrypted inputs only achieved statistical security. An additional advantage is that larger inputs are allowed.

show abstract

Security and efficiency analysis of the Hamming distance computation protocol based on oblivious transfer

Kiraz

Genç

Kardaş

2015

Security Comm Networks

View full text Add to dashboard Cite

Abstract-In Financial Cryptography 2013, Bringer, Chabanne and Patey proposed two cryptographic protocols for the computation of Hamming distance in the two-party setting. Their first scheme uses Oblivious Transfer and provides security in the semi-honest model. The other scheme uses Committed Oblivious Transfer (COT) and is claimed to provide full security in the malicious case. The proposed protocols have direct implications to biometric authentication schemes between a prover and a verifier where the verifier has biometric data of the users in plain form.In this paper, we show that their protocol against malicious adversaries is not actually secure. Namely, we show a generic attack such that a malicious user can compute a Hamming distance which is different from the actual value. For biometric authentication systems, this attack allows a malicious adversary to pass the authentication without knowledge of the honest user's input with at most O(n) complexity instead of O(2 n ), where n is the input length. We propose an enhanced version of their protocol where this attack is eliminated. The security of our modified protocol is proved using simulation-based paradigm. Also as for efficiency concerns, the modified protocol utilizes Verifiable Oblivious Transfer (VOT) which excludes the commitments to outputs (as they exist in COT). We show that the use of VOT does not reduce the security of the protocol but improves the efficiency significantly.

show abstract

A correction to 'efficient and secure comparison for on-line auctions'

Cited by 78 publications

References 3 publications

Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima

Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima

Improving the DGK comparison protocol

Security and efficiency analysis of the Hamming distance computation protocol based on oblivious transfer

Contact Info

Product

Resources

About