The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
The design and implementation of a secure auction service
Abstract
We present the design and implementation of a distributed service for performing sealed bid auctions. This service provides an interface by which clients, or "bidders", can issue secret bids to the service for an advertised auction. Once the bidding period has ended, the auction service opens the bids, determines the winning bid, and provides the winning bidder with a ticket for claiming the item bid upon. Using novel cryptographic techniques, the service is constructed to provide strong protection for both the auction house and correct bidders, despite the malicious behavior of any number of bidders and fewer than one third of the servers comprising the auction service. Specifically, it is guaranteed that: bids of correct bidders are not revealed until after the bidding period has ended; the auction house collects payment for the winning bid; losing bidders forfeit no money; and only the winning bidder can collect the item bid upon. We also discuss techniques to enable anonymous bidding.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Safeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
McAfee, R. P., & McMillan, J. (1986) · Scholarship@Western (Western University) · Cited by 2,240
The MD5 Message-Digest Algorithm
Rivest, R. (1992) · doi:10.17487/rfc1321 · Cited by 1,976
Security without identification: transaction systems to make big brother obsolete
Chaum, D. (1985) · Communications of the ACM · doi:10.1145/4372.4373 · Cited by 1,666
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_22 · Cited by 1,381
A practical scheme for non-interactive verifiable secret sharing
Feldman, P. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.4 · Cited by 1,125
Untraceable Electronic Cash: (Extended Abstract)
Chaum, D., Fiat, A., & Naor, M. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_25 · Cited by 1,120
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Rabin, M. O. (1979) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,020
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
(2007) · Brute Force · doi:10.1007/0-387-27160-0_3 · Cited by 934
Verifiable secret sharing and achieving simultaneity in the presence of faults
Chor, B., Goldwasser, S., Micali, S., & Awerbuch, B. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.64 · Cited by 771
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_68 · Cited by 751
Untraceable Off-line Cash in Wallet with Observers
Brands, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_26 · Cited by 507
How to share a function securely
De Santis, A., Desmedt, Y., Frankel, Y., & Yung, M. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195405 · Cited by 328
Desmedt, Y. G. (1994) · European Transactions on Telecommunications · doi:10.1002/ett.4460050407 · Cited by 292
Secure agreement protocols: reliable and atomic group multicast in rampart
Reiter, M. K. (1994) · Proceedings of the 2nd ACM Conference on Computer and communications security - CCS '94 · doi:10.1145/191177.191194 · Cited by 289
Self-citationDistributed Provers with Applications to Undeniable Signatures
Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_20 · Cited by 214
NetCash: a design for practical electronic currency on the Internet
Medvinsky, G., & Neuman, C. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168601 · Cited by 212
Low-Exponent RSA with Related Messages
Coppersmith, D., Franklin, M., Patarin, J., & Reiter, M. K. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9_1 · Cited by 130
Self-citationThe ESPRIT project CAFE —High security digital payment systems
Boly, J. P., Bosselaers, A., Cramer, R., Michelsen, R., Mjølsnes, S. F., Muller, F., Pedersen, T., Pfitzmann, B., de Rooij, P., Schoenmakers, B., et al. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58618-0_66 · Cited by 89
CryptoLib: Cryptography in Software
Lacy, J. B. (1993) · USENIX Security Symposium · Cited by 71
Franklin, M. K., & Reiter, M. K. (1995) · Lecture notes in computer science · doi:10.1007/3-540-49264-x_5 · Cited by 51
Self-citation
Cited by
Privacy preserving auctions and mechanism design
Naor, M., Pinkas, B., & Sumner, R. (1999) · Proceedings of the 1st ACM conference on Electronic commerce · doi:10.1145/336992.337028 · Cited by 753
Mix and Match: Secure Function Evaluation via Ciphertexts
Jakobsson, M., & Juels, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_13 · Cited by 276
Efficient private bidding and auctions with an oblivious third party
Cachin, C. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319726 · Cited by 267
Competitive auctions and digital goods
Goldberg, A. V., Hartline, J. D., & Wright, A. (2001) · doi:10.5555/365411.365768 · Cited by 257
Metadata
- Authors
- Franklin, M. K., & Reiter, M. K.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 1996-05
- Volume
- 22
- Issue
- 5
- Pages
- 302-312
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2103761955
- Cited by
- 274
- References
- 28
- FWCI
- 5.77
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.