How to exchange (secret) keys

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

How to exchange (secret) keys

Full text

Pdf (1.25 MB)

Source

ACM Transactions on Computer Systems (TOCS) archive
Volume 1 , Issue 2 (May 1983) table of contents

Pages: 175 - 193

Year of Publication: 1983

ISSN:0734-2071

Author

Manuel Blum

Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, Berkeley, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 68, Citation Count: 19

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/357360.357368 What is a DOI?

Warning: The download time has expired please click on the item to try again.

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	ADLEMAN, L., MANDERS, K., AND MILLER, G. On taking roots in finite fields. In Proc. 18th Annual IEEE Symposium on Foundations of Comp. Sci. (Providence, R.I., Oct. 31-Nov. 2, 1977), IEEE, New York, pp. 175-177.
	2	ANGLUIN, D. Lecture notes on the complexity of some problems in number theory. Tech. Rep. 243, Dept. of Computer Science, Yale University, New Haven, Conn., Aug. 1982.
	3	Eric Bach, Fast algorithms under the extended riemann hypothesis: A concrete estimate, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.290-295, May 05-07, 1982, San Francisco, California, United States [doi>10.1145/800070.802203]
	4	BERLEKAMP, E.R. Factoring polynomials over large finite fields. Math. Comput. 24, 111 (July 1970), 713-735.
	5	BLUM, M., AND RABIN, M.O. Mail certification by randomization. In preparation.
	6	DIFFIE, W., AND HELLMAN, M.E. Privacy and authentication: An introduction to cryptography. Proc. IEEE 67, 3 (March 1979), 397-427.
	7	EVEN, S., GOLDREICH, O., AND LEMPEL, A. A randomized protocol for signing contracts. Tech. Rep. 233, The Technion, Israel, Feb. 1982.
	8	KOLATA, G. Cryptographers gather to discuss research. Science, 214, 6 (Nov. 1981), 646-647.
	9	LEVEQUE, W.J. Fundamentals of Number Theory. Addison-Wesley, Reading, Mass., 1977.
	10	MILLER, G.L. Riemann's hypothesis and a test for primality. J. Comput. Syst. Sci. 13, 3 (Dec. 1976), 300-317.
	11	PETERSON, I. Whom do you trust. Science News 120, 13 (Sept. 1981), 205-206.
	12	M. O. Rabin, DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION, Massachusetts Institute of Technology, Cambridge, MA, 1979
	13	RABIN, M.O. How to exchange secrets by oblivious transfer. Manuscript, Harvard Center for Research in Computer Technology, Cambridge, Mass., 1981.
	14	RABIN, M. O. Transaction protection by beacons. Tech. Rep. 29-81, Harvard Center for Research in Computer Technology, Cambridge, Mass., 1981.
	15	RABIN, M.O. Probabilistic algorithm for testing primality. J. Number Theory 12, 1 (Feb. 1980), 128-138.
	16	R. L. Rivest , A. Shamir , L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, v.21 n.2, p.120-126, Feb. 1978 [doi>10.1145/359340.359342]
	17	Daniel Shanks, Solved and unsolved problems in number theory, Chelsea Publishing Co., Inc., New York, 1985
	18	SOLOVAY, R., AND STRASSEN, V. A fast Monte-Carlo test for primality. SIAM J. Comput. 6, (March 1977), 84-85.

CITED BY 19

	Bill Horne , Benny Pinkas , Tomas Sander, Escrow services and incentives in peer-to-peer networks, Proceedings of the 3rd ACM conference on Electronic Commerce, p.85-94, October 14-17, 2001, Tampa, Florida, USA
	J Hastad , A Shamir, The cryptographic security of truncated linearly related variables, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.356-362, May 06-08, 1985, Providence, Rhode Island, United States
	Matthew K. Franklin , Michael K. Reiter, Fair exchange with a semi-trusted third party (extended abstract), Proceedings of the 4th ACM conference on Computer and communications security, p.1-5, April 01-04, 1997, Zurich, Switzerland
	Birgit Pfitzmann , Matthias Schunter , Michael Waidner, Optimal efficiency of optimistic contract signing, Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, p.113-122, June 28-July 02, 1998, Puerto Vallarta, Mexico
	Shimon Even , Oded Goldreich , Abraham Lempel, A randomized protocol for signing contracts, Communications of the ACM, v.28 n.6, p.637-647, June 1985
	Indrajit Ray , Indrakshi Ray, Fair exchange in E-commerce, ACM SIGecom Exchanges, v.3 n.2, p.9-17, Spring, 2002
	Jung Min Park , Edwin K. P. Chong , Howard Jay Siegel, Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures, Proceedings of the twenty-second annual symposium on Principles of distributed computing, p.172-181, July 13-16, 2003, Boston, Massachusetts
	Donald Beaver, Server-assisted cryptography, Proceedings of the 1998 workshop on New security paradigms, p.92-106, September 22-26, 1998, Charlottesville, Virginia, United States
	Nan Zhang , Wei Zhao, Distributed privacy preserving information sharing, Proceedings of the 31st international conference on Very large data bases, August 30-September 02, 2005, Trondheim, Norway
	Chih-Hung Wang , Yan-Sheng Kuo, An efficient contract signing protocol using the aggregate signature scheme to protect signers' privacy and promote reliability, ACM SIGOPS Operating Systems Review, v.39 n.4, p.66-79, October 2005
	Holger Vogt , Felix C. Gärtner , Henning Pagnia, Supporting fair exchange in mobile environments, Mobile Networks and Applications, v.8 n.2, p.127-136, April 2003
	Aleksandra Nenadić , Ning Zhang , Stephen Barton, Fair certified e-mail delivery, Proceedings of the 2004 ACM symposium on Applied computing, March 14-17, 2004, Nicosia, Cyprus
	Joseph Halpern , Vanessa Teague, Rational secret sharing and multiparty computation: extended abstract, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, USA
	Tirthankar Ghosh , Niki Pissinou , Kami Makki, Towards designing a trusted routing solution in mobile ad hoc networks, Mobile Networks and Applications, v.10 n.6, p.985-995, December 2005
	Indrajit Ray , Indrakshi Ray , Narasimhamurthi Natarajan, An anonymous and failure resilient fair-exchange e-commerce protocol, Decision Support Systems, v.39 n.3, p.267-292, May 2005
	Aleksandra Nenadić , Ning Zhang , Qi Shi, RSA-based verifiable and recoverable encryption of signatures and its application in certified e-mail delivery, Journal of Computer Security, v.13 n.5, p.757-777, October 2005
	Andrés Marín López , Daniel Díaz Sánchez , Florina Almenárez , Carlos García Rubio , Celeste Campo, Smart card-based agents for fair non-repudiation, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.51 n.9, p.2288-2298, June, 2007
	Soongohn Kim , Seoksoo Kim , Geuk Lee, Secure verifiable non-interactive oblivious transfer protocol using RSA and Bit commitment on distributed environment, Future Generation Computer Systems, v.25 n.3, p.352-357, March, 2009
	Debajyoti Konar , Chandan Mazumdar, A generalised model of e-trading for gradual secret release fair exchange protocol, International Journal of Electronic Security and Digital Forensics, v.2 n.1, p.101-111, March 2009