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

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Yuji Watanabe Institute of Industrial Science, University of Tokyo, 7-22-1 Roppongi, Minatoku, Tokyo, 106-8558, Japan
Hideki Imai Institute of Industrial Science, University of Tokyo, 7-22-1 Roppongi, Minatoku, Tokyo, 106-8558, Japan
Published in:
· Proceeding
CCS '00 Proceedings of the 7th ACM conference on Computer and communications security
Pages 80-86
ACM New York, NY, USA ©2000
table of contents ISBN:1-58113-203-4 doi>10.1145/352600.352612
Reducing the round complexity of a sealed-bid auction protocol with an off-line TTP Published by ACM 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 10
· Downloads (12 Months): 23
· Downloads (cumulative): 373
· Citation Count: 7


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder