Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption

Mitsunaga, Takuho; Manabe, Yoshitsugu; Okamoto, Tatsuaki

doi:10.1007/978-3-642-16825-3_11

Cited by 9 publications

(9 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to address this problem, we introduce a secure auction protocol. Secure auction protocols have been proposed in cryptography theory [1,11,13]. They are outlined as follows.…”

Section: Cryptographic Moving-knife Protocolmentioning

confidence: 99%

“…The details are shown in [1,11,13]. Secure auction protocols use a homomorphic encryption, in which addition of encrypted values can be accomplished without decrypting them.…”

Section: Cryptographic Moving-knife Protocolmentioning

confidence: 99%

“…They jointly decrypt C and obtain the maximum bid without knowing each bid. In some secure auction protocol [13], another type of homomorphic encryption scheme is used in which multiplication of two ciphertexts are also possible.…”

Section: Cryptographic Moving-knife Protocolmentioning

confidence: 99%

See 2 more Smart Citations

A Cryptographic Moving-Knife Cake-Cutting Protocol

Manabe¹,

Okamoto²

2012

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

This paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier moving-knife protocol with one knife achieves simple fairness, all players must execute the protocol synchronously. Thus, the protocol cannot be executed on asynchronous networks such as the Internet. We show that the moving-knife protocol can be executed asynchronously by a discrete protocol using a secure auction protocol. The number of cuts is n-1 where n is the number of players, which is the minimum

show abstract

“…In order to address this problem, we introduce a secure auction protocol. Secure auction protocols have been proposed in cryptography theory [1,11,13]. They are outlined as follows.…”

Section: Cryptographic Moving-knife Protocolmentioning

confidence: 99%

“…The details are shown in [1,11,13]. Secure auction protocols use a homomorphic encryption, in which addition of encrypted values can be accomplished without decrypting them.…”

Section: Cryptographic Moving-knife Protocolmentioning

confidence: 99%

See 1 more Smart Citation

A Cryptographic Moving-Knife Cake-Cutting Protocol

Manabe¹,

Okamoto²

2012

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…This 2 Security and Communication Networks observation motivates people to study solutions to various secure multiparty computation problems. The problems studied include millionaires' problems [11,12], secure computational geometry problems [13], comparisons of information without it being leaked [14], private bidding and auction problems [15], and privacy-preserving data mining problems [16]. In addition, there are many other new secure multiparty problems that need to be studied.…”

Section: Introductionmentioning

confidence: 99%

Efficient Secure Multiparty Subset Computation

Zhou

Dou

et al. 2017

Security and Communication Networks

View full text Add to dashboard Cite

Secure subset problem is important in secure multiparty computation, which is a vital field in cryptography. Most of the existing protocols for this problem can only keep the elements of one set private, while leaking the elements of the other set. In other words, they cannot solve the secure subset problem perfectly. While a few studies have addressed actual secure subsets, these protocols were mainly based on the oblivious polynomial evaluations with inefficient computation. In this study, we first design an efficient secure subset protocol for sets whose elements are drawn from a known set based on a new encoding method and homomorphic encryption scheme. If the elements of the sets are taken from a large domain, the existing protocol is inefficient. Using the Bloom filter and homomorphic encryption scheme, we further present an efficient protocol with linear computational complexity in the cardinality of the large set, and this is considered to be practical for inputs consisting of a large number of data. However, the second protocol that we design may yield a false positive. This probability can be rapidly decreased by reexecuting the protocol with different hash functions. Furthermore, we present the experimental performance analyses of these protocols.

show abstract

“…This malleability property is of crucial interest since it is the core of many electronic realizations of real-life applications like electronic voting [BFP+01,DJ01], private information retrieval [Lip05], verifiable encryption [FPS00], mix-nets [NSNK06,Jur03], auction protocols [MMO10], etc. The Elgamal encryption is a classical example of such a homomorphic encryption, since, given two ciphertexts, it is easy to obtain the encryption of the product of the two corresponding plaintexts.…”

Section: Introductionmentioning

confidence: 99%

Security and Cryptography for Networks

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

PrefaceThe 8th Conference on Security and Cryptography for Networks (SCN 2012) was held in Amalfi, Italy, during September 5-7, 2012. This biennial conference has traditionally been held in Amalfi, with the exception of the fifth edition which was held in nearby Maiori.The world-wide use of computer networks, and in particular of the Internet, opens new challenges for the security of electronic and distributed transactions. Cryptography and information security must face both the theoretical and practical aspects of the above challenges, by providing concepts, techniques, applications, and practical experiences. The principal aim of SCN as a conference is to bring together researchers, practitioners, developers, and users interested in the above fields, to foster cooperation and to exchange techniques, tools, experiences, and ideas in the stunning Amalfi Coast setting.The conference received 72 submissions in a broad range of cryptography and security areas. The selection of papers was a difficult task. This year we received many high-quality submissions and 31 of them were accepted for publication in these proceedings on the basis of quality, originality, and relevance to the conference's scope.At least three Program Committee (PC) members-out of 28 world-renowned experts in the conference's various areas of interest-reviewed each submitted paper, while submissions co-authored by a PC member were subjected to the more stringent evaluation of five PC members.In addition to the PC members, many external reviewers joined the review process in their particular areas of expertise. We were fortunate to have this knowledgeable and energetic team of experts, and are deeply grateful to all of them for their hard and thorough work, which included a very active discussion phase-almost as long as the initial individual reviewing period. The paper submission, review, and discussion processes were effectively and efficiently made possible by the Web-Submission-and-Review software, written by Shai Halevi, and hosted by the International Association for Cryptologic Research (IACR). Many thanks to Shai for his assistance with the system's various features and for his constant availability.Given the perceived quality of the submissions, the PC decided also this year to give a Best-Paper Award, both to promote outstanding work in the fields of cryptography and information security and to keep encouraging high-quality submissions to SCN. "Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting" by Xiang Xie, Rue Xue, and Rui Zhang was conferred such distinction.The program was further enriched by the invited talks of Yuval Ishai (Technion, Israel) and Giuseppe Persiano (Università di Salerno, Italy), top experts on the subjects of the conference. VI PrefaceWe thank all the authors who submitted papers to this conference; the Organizing Committee members, colleagues, and student helpers for their valuable time and effort; and all the conference attendees who made this event a t...

show abstract

Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption

Cited by 9 publications

References 12 publications

A Cryptographic Moving-Knife Cake-Cutting Protocol

A Cryptographic Moving-Knife Cake-Cutting Protocol

Efficient Secure Multiparty Subset Computation

Security and Cryptography for Networks

Contact Info

Product

Resources

About