An efficient probabilistic public key encryption scheme which hides all partial information
Proceedings of CRYPTO 84 on Advances in cryptology
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Verifiable disclose for secrets and applications (abstract)
EUROCRYPT '89 Proceedings of the 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
Efficient private bidding and auctions with an oblivious third party
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Committed Oblivious Transfer and Private Multi-Party Computation
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Non-interactive Private Auctions
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Private Selective Payment Protocols
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
An Auction Protocol Which Hides Bids of Losers
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Electronic auctions with private bids
WOEC'98 Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Minimal-latency secure function evaluation
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
Receipt-Free Sealed-Bid Auction
ISC '02 Proceedings of the 5th International Conference on Information Security
First price sealed bid auction without auctioneers
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
On the Existence of Unconditionally Privacy-Preserving Auction Protocols
ACM Transactions on Information and System Security (TISSEC)
Efficient bid validity check in ElGamal-based sealed-bid e-auction
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Secure multiparty computation of DNF
ICICS'07 Proceedings of the 9th international conference on Information and communications security
On server trust in private proxy auctions
Electronic Commerce Research
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
Practicalization of a range test and its application to e-auction
EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
Secure E-auction for mobile users with low-capability devices in wireless network
WISTP'11 Proceedings of the 5th IFIP WG 11.2 international conference on Information security theory and practice: security and privacy of mobile devices in wireless communication
A secure M + 1st price auction protocol based on bit slice circuits
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
Fast contract signing with batch oblivious transfer
CMS'05 Proceedings of the 9th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
Efficient privacy-preserving protocols for multi-unit auctions
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Bidder-anonymous English auction protocol based on revocable ring signature
Expert Systems with Applications: An International Journal
An efficient and verifiable solution to the millionaire problem
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Ciphertext comparison, a new solution to the millionaire problem
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Secure multi-attribute procurement auction
WISA'05 Proceedings of the 6th international conference on Information Security Applications
Measuring vote privacy, revisited
Proceedings of the 2012 ACM conference on Computer and communications security
Development and evaluation of a secure, privacy preserving combinatorial auction
AISC '11 Proceedings of the Ninth Australasian Information Security Conference - Volume 116
| Hi-index | 0.02 |
Naor, Pinkas, and Sumner introduced and implemented a sealed-bid, two-server auction system that is perhaps the most efficient and practical to date. Based on a cryptographic primitive known as oblivious transfer, their system aims to ensure privacy and correctness provided that at least one auction server behaves honestly. As observed in [19], however, the NPS system suffers from a security flaw in which one of the two servers can cheat so as to modify bids almost arbitrarily and without detection. We propose a means of repairing this flaw while preserving the attractive practical elements of the NPS protocol, including minimal round complexity for servers and minimal computation by players providing private inputs. Our proposal requires a slightly greater amount of computation and communication on the part of the two auction servers, but actually involves much less computation on the part of bidders. This latter feature makes our proposal particularly attractive for use with low-power devices. While the original proposal of NPS involved several dozen exponentiations for a typical auction, ours by contrast involves only several dozen modular multiplications. The key idea in our proposal is a form of oblivious transfer that we refer to as verifiable proxy oblimous transfer (VPOT).