Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
The Design and Implementation of a Secure Auction Service
IEEE Transactions on Software Engineering
Communications of the ACM
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Communications of the ACM
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Efficient Generation of Shared RSA Keys (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically)
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
The Cocaine Auction Protocol: On the Power of Anonymous Broadcast
IH '99 Proceedings of the Third International Workshop on Information Hiding
Split Knowledge Generation of RSA Parameters
Proceedings of the 6th IMA International Conference on Cryptography and Coding
An Efficient Non-repudiation Protocol
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Crowds: Anonymity for Web Transactions
Crowds: Anonymity for Web Transactions
Time-lock Puzzles and Timed-release Crypto
Time-lock Puzzles and Timed-release Crypto
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
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
We present a sealed-bid electronic auction scheme that is equitably fair for the bidders and the seller. In this scheme, the interests of both the bidders and the seller are safeguarded: the identity of the non-winning bidders and their bidding behavior are protected (anonymity), and the bidders cannot withdraw their bids without being detected (non-repudiation). The scheme fulfills the requirements of a secure auction scheme and is verifiable. It extends the Stubblebine & Syverson auction scheme that is not equitably fair (it does not prevent bid withdrawals). Our scheme employs a Registar and an Auctioneer for which no special trust assumptions are made.