STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
Communications of the ACM
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
How to Solve any Protocol Problem - An Efficiency Improvement
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols.
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols.
WOEC'98 Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3
Electronic auctions with private bids
WOEC'98 Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
On monotone formula closure of SZK
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Proving in zero-knowledge that a number is the product of two safe primes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
Cryptographic Protocols for Secure Second-Price Auctions
CIA '01 Proceedings of the 5th International Workshop on Cooperative Information Agents V
Receipt-Free Sealed-Bid Auction
ISC '02 Proceedings of the 5th International Conference on Information Security
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
Private collaborative forecasting and benchmarking
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
An asynchronous and secure ascending peer-to-peer auction
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Practical secrecy-preserving, verifiably correct and trustworthy auctions
ICEC '06 Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet
First price sealed bid auction without auctioneers
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
A secure double auction protocol against false bids
Decision Support Systems
On the Existence of Unconditionally Privacy-Preserving Auction Protocols
ACM Transactions on Information and System Security (TISSEC)
Practical secrecy-preserving, verifiably correct and trustworthy auctions
Electronic Commerce Research and Applications
Agent-oriented privacy-based information brokering architecture for healthcare environments
International Journal of Telemedicine and Applications - Special issue on electronic health
Secure combinatorial auctions by dynamic programming with polynomial secret sharing
FC'02 Proceedings of the 6th international conference on Financial cryptography
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
Cryptocomputing with rationals
FC'02 Proceedings of the 6th international conference on Financial cryptography
Identity-committable signatures and their extension to group-oriented ring signatures
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Auctions in do-not-track compliant internet advertising
Proceedings of the 18th ACM conference on Computer and communications security
Efficient privacy-preserving protocols for multi-unit auctions
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
A novel construction of two-party private bidding protocols from yao's millionaires problem
TrustBus'05 Proceedings of the Second international conference on Trust, Privacy, and Security in Digital Business
Service allocation in selfish mobile ad hoc networks using vickrey auction
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Secure multi-attribute procurement auction
WISA'05 Proceedings of the 6th international conference on Information Security Applications
A robust double auction protocol based on a hybrid trust model
ICISS'05 Proceedings of the First international conference on Information Systems 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.00 |
We describe a new auction protocol that enjoys the following properties: the biddings are submitted non-interactively and no information beyond the result is disclosed. The protocol is efficient for a logarithmic number of players. Our solution uses a semi-trusted third party T who learns no information provided that he does not collude with any participant. The robustness against active cheating players is achieved through an extra mechanism for fair encryption of a bit which is of independent interest. The scheme is based on homomorphic encryption but differs from general techniques of secure circuit evaluation by taking into account the level of each gate and allowing efficient computation of unbounded logical gates. In a scenario with a small numbers of players, we believe that our work may be of practical significance, especially for electronic transactions.