Distributed fingerprints and secure information dispersal

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Distributed fingerprints and secure information dispersal

Full text

Pdf (1.03 MB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the twelfth annual ACM symposium on Principles of distributed computing table of contents

Ithaca, New York, United States

Pages: 207 - 218

Year of Publication: 1993

ISBN:0-89791-613-1

Author

Hugo Krawczyk

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 47, Citation Count: 10

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/164051.164075 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Blahut, R., "Theory and Practice of Error Control Codes", Addison-Wesley, 1984.
	2	Blakley, G.R., "Safeguarding Cryptographic Keys", Proc. AFIP$ 1979 National Computer Conference, New York, Vol. 48, 1979, pp. 313-317.
	3	B.O. Brachtal, D. Coppersmith, M.M. Hyden, S.M. Matyaa, C.H.W. Meyer, J. Oseas, S. Pilpel and M. Shilling, "Data authentication using modification detection codes based on a public one-way encryption function", U.S. Patent No. 4,908,861. (See also Meyer, C. and Schilling M., "Secure Program Load using Manipulation Detection Code", Proceedings of Securicom, 1988).
	4	Damgard, I.B., "Collision Free Hash Functions and Public Key Signature Schemes", Proc. Eurocrypt '87, pp. 203-216.
	5	Dolev, D., Dwork, C., Waarts, O., and Yung, M., "Perfectly Secure Message Transmission'', Proc. 31st FOC$, 1990, pp. 36-45.
	6	Krawczyk, H., "Secret Sharing Made Short", manuscript.
	7	R. J. McEliece , D. V. Sarwate, On sharing secrets and Reed-Solomon codes, Communications of the ACM, v.24 n.9, p.583-584, Sept. 1981 [doi>10.1145/358746.358762]
	8	M. Naor , M. Yung, Universal one-way hash functions and their cryptographic applications, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.33-43, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73011]
	9	"Secure Hash Standard Draft", NIST, February 1992.
	10	Preparata, F.P., "Holographic Dispersal and Recovery of information", IEEE Trans. on Information Theory, IT-35, No. 5, 1989, pp. 1123-1124.
	11	Michael O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, Journal of the ACM (JACM), v.36 n.2, p.335-348, April 1989 [doi>10.1145/62044.62050]
	12	Ronald L. Rivest, The MD4 Message Digest Algorithm, Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, p.303-311, August 11-15, 1990
	13	J. Rompel, One-way functions are necessary and sufficient for secure signatures, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.387-394, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100269]
	14	Alexander Russell, Necessary and Sufficient Conditions For Collision-Free Hashing, Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, p.433-441, August 16-20, 1992
	15	Adi Shamir, How to share a secret, Communications of the ACM, v.22 n.11, p.612-613, Nov. 1979 [doi>10.1145/359168.359176]
	16	M. Tompa , H. Woll, How to share a secret with cheaters, Journal of Cryptology, v.1 n.2, p.133-138, Aug. 1988

CITED BY 10

	Michael K. Reiter , Kenneth P. Birman, How to securely replicate services, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.986-1009, May 1994
	Dahlia Malkhi , Julien Stern, Scalable secure storage when half the system is faulty, Information and Computation, v.174 n.2, p.203-213, May 1 2002
	Daniel Ellard , James Megquier, DISP: Practical, efficient, secure and fault-tolerant distributed data storage, ACM Transactions on Storage (TOS), v.1 n.1, p.71-94, February 2005
	Jung Min Park , Edwin K. P. Chong , Howard Jay Siegel, Efficient multicast stream authentication using erasure codes, ACM Transactions on Information and System Security (TISSEC), v.6 n.2, p.258-285, May 2003
	Ya-Jeng Lin , Shiuhpyng Shieh , Warren W. Lin, Lightweight, pollution-attack resistant multicast authentication scheme, Proceedings of the 2006 ACM Symposium on Information, computer and communications security, March 21-24, 2006, Taipei, Taiwan
	Umesh Maheshwari , Radek Vingralek , William Shapiro, How to build a trusted database system on untrusted storage, Proceedings of the 4th conference on Symposium on Operating System Design & Implementation, p.10-10, October 22-25, 2000, San Diego, California
	James Hendricks , Gregory R. Ganger , Michael K. Reiter, Verifying distributed erasure-coded data, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, August 12-15, 2007, Portland, Oregon, USA
	Daniel Bleichenbacher , Aggelos Kiayias , Moti Yung, Decoding interleaved Reed-Solomon codes over noisy channels, Theoretical Computer Science, v.379 n.3, p.348-360, June, 2007
	Manghui Tu , Zhonghang Xia , Peng Li , Nasser Tadayon, Allocation of partitioned data by using a neural network based approach, Neurocomputing, v.72 n.4-6, p.1000-1011, January, 2009
	Phillip Rogaway , Mihir Bellare, Robust computational secret sharing and a unified account of classical secret-sharing goals, Proceedings of the 14th ACM conference on Computer and communications security, October 28-31, 2007, Alexandria, Virginia, USA