Author:
Franklin Matthew K.,Reiter Michael K.
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. D. Beaver, S. Micali, and P. Rogaway, “The round complexity of secure protocols,” ACM STOC 1990, 503–513.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computation,” ACM STOC 1988, 1–9.
3. E. Berlekamp and L. Welch, “Error correction of algebraic block codes,” U.S. Patent Number 4,633,470.
4. G. Blakely “Safeguarding cryptographic keys,” AFIPS National Computer Conference 48 (1979), 313–317.
5. D. Chaum, “Security without identification: transaction systems to make big brother obsolete,” CACM 28 (1985), 1030–1044.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献