A secure M + 1st price auction protocol based on bit slice circuits

Authors:
Takuho Mitsunaga;Yoshifumi Manabe;Tatsuaki Okamoto
Affiliations:
Graduate School of Informatics, Kyoto University, Kyoto city Japan;NTT Communication Science Laboratories, NTT Laboratory, Seikacho, Kyoto, Japan;NTT Information Sharing Platform Laboratories, Musashino city, Tokyo, Japan
Venue:
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
Year:
2011

Citing 13
Cited 0

Efficient anonymous channel and all/nothing election scheme

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
The Design and Implementation of a Secure Auction Service

IEEE Transactions on Software Engineering
Privacy preserving auctions and mechanism design

Proceedings of the 1st ACM conference on Electronic commerce
Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
Bit-Slice Auction Circuit

ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
Efficient Generation of Shared RSA Keys (Extended Abstract)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Mix and Match: Secure Function Evaluation via Ciphertexts

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
M+1-st Price Auction Using Homomorphic Encryption

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A two-server, sealed-bid auction protocol

FC'02 Proceedings of the 6th international conference on Financial cryptography
Secure Vickrey auctions without threshold trust

FC'02 Proceedings of the 6th international conference on Financial cryptography
Efficient secure auction protocols based on the Boneh-Goh-Nissim encryption

IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Evaluating 2-DNF formulas on ciphertexts

TCC'05 Proceedings of the Second international conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient secure auction protocol for M +1st price auction. In our proposed protocol, bidding prices are represented as binary numbers. Thus, when the bidding price is an integer up to p and the number of bidders is m, the complexity of our protocol is a polynomial of log p and m, while in previous secure M + 1st price auction protocols, the complexity is a polynomial of p and m. We apply the Boneh-Goh-Nissim encryption to the mix-and-match protocol to reduce the computation costs.