Efficient and Secure Comparison for On-Line Auctions

Damgård, Ivan; Geisler, Martin; Krøigaard, Mikkel

doi:10.1007/978-3-540-73458-1_30

Cited by 150 publications

(183 citation statements)

References 12 publications

Supporting

Mentioning

165

Contrasting

Order By: Relevance

“…In the following we show that our GC-based comparison protocol outperforms the comparison protocol of Damgård, Geisler and Kroigård presented in [DGK07] for the online auction scenario.…”

Section: First-price Auctionsmentioning

confidence: 70%

“…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 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

“…In the following we show that our GC-based comparison protocol outperforms the comparison protocol of Damgård, Geisler and Kroigård presented in [DGK07] for the online auction scenario.…”

Section: First-price Auctionsmentioning

confidence: 70%

Section: Homomorphic Encryption (He)mentioning

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

“…An important application arises in the context of secure integer comparisons, as noted first in [20]. A common step in many integer comparison protocols [2,1,10,8,20], requires parties to find out whether a special value occurs in a given list of encryptions. For example, whether there is a 0 among otherwise random values.…”

Section: Introductionmentioning

confidence: 99%

Verifiable Rotation of Homomorphic Encryptions

Hoogh

Schoenmakers

Škorić

et al. 2009

Public Key Cryptography – PKC 2009

View full text Add to dashboard Cite

Abstract. Similar to verifiable shuffling (mixing), we consider the problem of verifiable rotating a given list of homomorphic encryptions. The offset by which the list is rotated (cyclic shift) should remain hidden. Basically, we will present zero-knowledge proofs of knowledge of a rotation offset and re-encryption exponents, which define how the input list is transformed into the output list. We also briefly address various applications of verifiable rotation, ranging from 'fragile mixing' as introduced by Reiter and Wang at CCS'04 to applications in protocols for secure multiparty computation and voting.We present two new, efficient protocols. Our first protocol is quite elegant and involves the use of the Discrete Fourier Transform (as well as the Fast Fourier Transform algorithm), and works under some reasonable conditions. We believe that this is the first time that Fourier Transforms are used to construct an efficient zero-knowledge proof of knowledge.Our second protocol is more general (requiring no further conditions) and only slightly less efficient than the DFT-based protocol. Unlike the previously best protocol by Reiter and Wang, however, which relies on extensive use of verifiable shuffling as a building block (invoking it four times as a sub-protocol), our construction is direct and its performance is comparable to the performance of a single run of the best protocol for verifiable shuffling.

show abstract

Security and Privacy in the Internet of Things

2021

View full text Add to dashboard Cite

The Internet of Things (IoT) is an emerging paradigm that seamlessly integrates electronic devices with sensing and computing capability into the Internet to achieve intelligent processing and optimized controlling. In a connected world built through IoT, where interconnected devices are extending to every facet of our lives, including our homes, offices, utility infrastructures and even our bodies, we are able to do things in a way that we never before imagined. However, as IoT redefines the possibilities in environment, society and economy, creating tremendous benefits, significant security and privacy concerns arise such as personal information confidentiality, and secure communication and computation. Theoretically, when everything is connected, everything is at risk. The ubiquity of connected things gives adversaries more attack vectors and more possibilities, and thus more catastrophic consequences by cybercrimes. Therefore, it is very critical to move fast to address these rising security and privacy concerns in IoT systems before severe disasters happen. In this dissertation, we mainly address the challenges in two domains: (1) how to protect IoT devices against cyberattacks;(2) how to protect sensitive data during storage, dissemination and utilization for IoT applications.In this section, I would like to express my gratitude to my advisor, my colleagues, my committee members and my family for their guidance, encouragement and support along the road of my PhD study.First of all, I would like to express my deepest gratitude to my advisor, Prof. Fengjun Li, for her tremendous support, guidance, encouragement, patience and contributions to the ideas in this dissertation. I could not have done this without her help. When I began my PhD, she led me to security field and help me grow from an undergraduate to a PhD. I will never forget her patience on guiding me to identify research questions, tackle them and write a research paper. Her patience, enthusiasm, knowledge and insights have been a great source of inspiration and will also benefit my whole life. I will always cherish the time we spent working together.

show abstract

Efficient and Secure Comparison for On-Line Auctions

Cited by 150 publications

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

Verifiable Rotation of Homomorphic Encryptions

Security and Privacy in the Internet of Things

Contact Info

Product

Resources

About