Reducing the round complexity of a sealed-bid auction protocol with an off-line TTP

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2000, Pages 80-86

  Watanabe, Y ^a   Imai, H ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY; INFORMATION RETRIEVAL; SECURITY OF DATA;

ENCRYPTION PROTOCOL; SEALED BID AUCTION PROTOCOL; THRUSTED THIRD PARTY; VERIFIABLE SIGNATURE SHARING;

ELECTRONIC COMMERCE;

EID: 0034447261     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/352600.352612     Document Type: Conference Paper

References (27)

1. Optimistic protocol for fair exchange
2. Optimistic fair exchange of digital signatures
3. A bulletin board-based auction system with protecting the bidder's strategy
4. Efficient sealed-bid auction with quantitative competition using one-way functions
5. The design and implementation of a secure auction service
6. Verifiable signature sharing
7. Multi-round anonymous auction schemes
8. Universary verifiable auction protocol which hides losing bids
9. A bulletin-board based digital auction scheme with bidding down strategy - towards anonymous electronic bidding without anonymous channels nor trusted centers
10. An auction protocol which hides bids of losers
11. Threshold cryptosystem
12. Efficient private bidding and auctions with an oblivious third party
13. Privacy preserving auctions and mechanism design
14. Efficient verifiable encryption (and fair exchange) of digital signatures
15. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
16. How to prove yourself: Practical solutions to identification and signature problems
17. A new public key cryptosystem based on higher residues
18. Wallet databases with observers
19. A group signature scheme with improved efficiency
20. Separability and efficiency for generic group signature schemes
21. Statistical zero knowledge protocols to prove modular polynomial relations
22. How to share a secret
23. Efficient identification and signatures for smart cards
24. Identity escrow
25. Restricted anonymous participation
26. A robust and verifiable cryptographically secure election scheme
27. Secure electronic sealed-bid auction protocol with public key cryptography