Homomorphic encryption and secure comparison

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

doi:10.1504/ijact.2008.017048

Cited by 173 publications

(128 citation statements)

References 15 publications

(18 reference statements)

Supporting

Mentioning

119

Contrasting

Unclassified

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%

“…Afterwards, the bidder can go offline, while the server and assisting server run a secure comparison protocol to compare the secret-shared maximum bid with the publicly known value of the currently highest bid to keep track which bidder is still "in the game". A detailed description of the scenario can be found in [DGK08b].…”

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 3 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: First-price Auctionsmentioning

confidence: 99%

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

show abstract

“…In 2007, Damgård, Geisler and Krøigaard (DGK) invented their secure comparison protocol [1] together with a new homomorphic cryptosystem that together formed an interesting and efficient solution for the so-called millionaire's problem. Their protocol has been used frequently ever since as a subprotocol in applications for signal processing with encrypted data.…”

Section: Introductionmentioning

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

A biometric‐based implicit authentication protocol with privacy protection for ubiquitous communication environments

Liu

Kannadasan

et al. 2023

Int J Communication

View full text Add to dashboard Cite

SummaryDue to the proliferation of the wireless communication technologies, we are now in the era of ubiquitous computing. People can enjoy services almost in any time and any location based on the mobile intelligent devices. Meanwhile, more and more personal information are transmitted through the network. To protect these sensitive information, authentication and privacy protection are primary concerns in ubiquitous communication environments. However, traditional physical‐based biometric authentication scheme usually requires explicit cooperation of the user, which is inconvenient to the users. In order to solve this problem, a behavior biometric authentication protocol with privacy protection is designed using matrix multiplication and homomorphic encryption for ubiquitous communication environments. The correctness, security, and privacy protection properties are proved with security analysis. Performance evaluation shows that our protocol achieves stronger security and higher communication efficiency compared with other related protocols, which makes it very suitable for ubiquitous communication environments because communication consumes much more energy than computation does in mobile communication.

show abstract

Homomorphic encryption and secure comparison

Cited by 173 publications

References 15 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

A biometric‐based implicit authentication protocol with privacy protection for ubiquitous communication environments

Contact Info

Product

Resources

About