A randomized protocol for signing contracts

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A randomized protocol for signing contracts

Full text

Pdf (1.23 MB)

Source

Communications of the ACM archive
Volume 28 , Issue 6 (June 1985) table of contents

Pages: 637 - 647

Year of Publication: 1985

ISSN:0001-0782

Authors

Shimon Even	Duke Univ., Durham, NC
Oded Goldreich	MIT Laboratory for Computer Science, Cambridge, MA
Abraham Lempel	Technion, Haifa, Israel

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 13, Downloads (12 Months): 125, Citation Count: 88

Additional Information:

abstract references cited by index terms review 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/3812.3818 What is a DOI?

ABSTRACT

Randomized protocols for signing contracts, certified mail, and flipping a coin are presented. The protocols use a 1-out-of-2 oblivious transfer subprotocol which is axiomatically defined.The 1-out-of-2 oblivious transfer allows one party to transfer exactly one secret, out of two recognizable secrets, to his counterpart. The first (second) secret is received with probability one half, while the sender is ignorant of which secret has been received.An implementation of the 1-out-of-2 oblivious transfer, using any public key cryptosystem, is presented.

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	Blum, M. private communication, 1981.
	2	Blum, M. Coin flipping by telephone, IEEE Spring COMCON, 1982.
	3	Manuel Blum, How to exchange (secret) keys, ACM Transactions on Computer Systems (TOCS), v.1 n.2, p.175-193, May 1983 [doi>10.1145/357360.357368]
	4	Blum, M., and Rabin, M.O. How to send certified electronic mail, in preparation.
	5	Richard A. DeMillo , Nancy A. Lynch , Michael J. Merritt, Cryptographic protocols, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.383-400, May 05-07, 1982, San Francisco, California, United States [doi>10.1145/800070.802214]
	6	Diffie, W., and Hellman, M.E. New directions in cryptography, IEEE Trans. hf. Theory, IT-22,6 (Nov. 1976). 644-654.
	7	Dolev, D., Even, S., and Karp. R.M. On the security of ping-pong protocols. hf. Control 55. (1982). 57-68.
	8	Dolev. D., and Yao, A.C. On the security of public key protocols, In Proceedings of the 22nd FOCS, 1981, 350-357. Also in IEEE Tmns. In/. Theory, IT-29,1983, 198-208.
	9	Even, S. A protocol for signing contracts. Tech. Rep. 231, Computer Science Dept., Technion, Haifa, Israel, Jan. 1982. Also presented at Crypt0 81.
	10	Even, S., and Goldreich, 0. On the security of multi-party ping-pong protocols. In Proceedings of fhe 24th FOCS, 1983, 34-39.
	11	Even, S., Goldreich, O., and Lempel, A. A randomized protocol for signing contracts. Tech. Rep. 233, Computer Science Dept.. Technion, Haifa. Israel, Feb. 1982. An extended abstract appears in Advances in Cryptology: Proceedings of Crypt0 82, D. Chaum, et al. Eds., Plenum Press, New York, 1983, pp. 205-210.
	12	Even, S., and Yacovi, Y. Relations among public key signature systems Tech. Rep. 175, Computer Science Dept., Technion. Haifa. Israel, Mar. 1980.
	13	Fischer, M., Micali, S., and Rackoff, C. An oblivious transfer equivalent to factoring. Presented at EuroCrypt 84.
	14	Goldreich, 0. A protocol for sending certified mail, Tech, Rep, 239, Computer Science Dept., Technion. Haifa, Israel, Apr. 1982.
	15	Goldreich. 0. On concurrent identification protocols. Tech. Rep. MIT/LCS/TM-250, Massachusetts Institute of Technology, Cambridge, Dec. 1983. Also presented at EuroCrypt 84.
	16	Goldreich, 0. Sending certified mail using oblivious transfer and a threshold scheme. Tech. Rep. 325, Science Dept., Technion, Haifa, Israel, July 1984. This is a revised version of Appendix H in On the security of cryptographic protocols and cryptosystems. DSc. thesis, Computer Science Dept., Technion. Haifa, Israel, 1983.
	17	Goldreich, 0. A simple protocol for signing contracts. In Advances in Cryptology: Proceedings ofCypt083. D. Chaum, Ed., Plenum Press, New York, 1984, pp. 133-136.
	18	Goldreich, O., Goldwasser, S.. and Micali, S. How to construct random functions. In Proceedings of the 25fh FOCS, 1984, 464-479.
	19	Shafi Goldwasser , Silvio Micali, Probabilistic encryption & how to play mental poker keeping secret all partial information, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.365-377, May 05-07, 1982, San Francisco, California, United States [doi>10.1145/800070.802212]
	20	Goldwasser, S.. Micali, S., and Rackoff, C. The knowledge complexity of theorem-proving procedures. In Proceedings of thei 7fh SfOC, to appear.
	21	Goldwasser, S.. Micali, S., and Rivest. R.L. A paradoxical signature scheme. In Proceedings of the 25th FOCS, 1984, 441-448.
	22	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 [doi>10.1145/22145.22184]
	23	Luby. M., Micali, S.. and Rackoff, C. How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. In Proceedings of the 24th FOCS, 1983, 11-21.
	24	Ralph C. Merkle, Secure communications over insecure channels, Communications of the ACM, v.21 n.4, p.294-299, April 1978 [doi>10.1145/359460.359473]
	25	National Bureau of Standards, Data Encryption Standard, Federal Information Processing Standards, Publ. 46. 1977.
	26	M. O. Rabin, DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION, Massachusetts Institute of Technology, Cambridge, MA, 1979
	27	Rabin, M.O. How to exchange secrets by oblivious transfer. unpublished manuscript, 1981.
	28	Rabin, M.O. Transaction protection by beacons. Tech. Rep. TR-29- 81, Aiken Computation Laboratory, Harvard Univ., Cambridge, Mass., 1981.
	29	Rackoff, C., and Luby. M. One-one pseudo-random function generation and DES, in preparation.
	30	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]
	31	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]
	32	Tom Tedrick, Fair exchange of secrets, Proceedings of CRYPTO 84 on Advances in cryptology, p.434-438, August 1985, Santa Barbara, California, United States
	33	Yao, AC. Protocols for secure computation. In Proceedings of the 23rd FOCS, 1982,160-164.

CITED BY 88

	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
	Ronald Fagin , Moni Naor , Peter Winkler, Comparing information without leaking it, Communications of the ACM, v.39 n.5, p.77-85, May 1996
	Ran Canetti , Yehuda Lindell , Rafail Ostrovsky , Amit Sahai, Universally composable two-party and multi-party secure computation, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
	O. Goldreich , S. Micali , A. Wigderson, How to play ANY mental game, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.218-229, January 1987, New York, New York, United States
	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
	Moni Naor , Benny Pinkas, Efficient oblivious transfer protocols, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.448-457, January 07-09, 2001, Washington, D.C., United States
	Ran Canetti , Yuval Ishai , Ravi Kumar , Michael K. Reiter , Ronitt Rubinfeld , Rebecca N. Wright, Selective private function evaluation with applications to private statistics, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, p.293-304, August 2001, Newport, Rhode Island, United States
	Wenliang Du , Mikhail J. Atallah, Secure multi-party computation problems and their applications: a review and open problems, Proceedings of the 2001 workshop on New security paradigms, September 10-13, 2001, Cloudcroft, New Mexico
	Joe Kilian, A general completeness theorem for two party games, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.553-560, May 05-08, 1991, New Orleans, Louisiana, United States
	Ran Canetti , Uri Feige , Oded Goldreich , Moni Naor, Adaptively secure multi-party computation, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.639-648, May 22-24, 1996, Philadelphia, Pennsylvania, United States
	Joe Kilian, Founding crytpography on oblivious transfer, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.20-31, May 02-04, 1988, Chicago, Illinois, United States
	Yehuda Lindell, Bounded-concurrent secure two-party computation without setup assumptions, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
	Moni Naor , Benny Pinkas, Oblivious transfer and polynomial evaluation, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.245-254, May 01-04, 1999, Atlanta, Georgia, United States
	Moni Naor , Benny Pinkas , Reuban Sumner, Privacy preserving auctions and mechanism design, Proceedings of the 1st ACM conference on Electronic commerce, p.129-139, November 03-05, 1999, Denver, Colorado, United States
	Tatsuaki Okamoto , Kazuo Ohta, How to simultaneously exchange secrets by general assumptions, Proceedings of the 2nd ACM Conference on Computer and communications security, p.184-192, November 1994, Fairfax, Virginia, United States
	Donald Beaver, Commodity-based cryptography (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.446-455, May 04-06, 1997, El Paso, Texas, United States
	Oded Goldreich , Silvio Micali , Avi Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Journal of the ACM (JACM), v.38 n.3, p.690-728, July 1991
	N. Zhang , Q. Shi , M. Merabti, An efficient protocol for anonymous and fair document exchange, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.41 n.1, p.19-28, 15 January 2003
	Indrajit Ray , Indrakshi Ray, Fair exchange in E-commerce, ACM SIGecom Exchanges, v.3 n.2, p.9-17, Spring, 2002
	Jian Yin , Jean-Philippe Martin , Arun Venkataramani , Lorenzo Alvisi , Mike Dahlin, Separating agreement from execution for byzantine fault tolerant services, Proceedings of the nineteenth ACM symposium on Operating systems principles, October 19-22, 2003, Bolton Landing, NY, USA
	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
	Oded Goldreich, Cryptography and cryptographic protocols, Distributed Computing, v.16 n.2-3, p.177-199, September 2003
	N. Asokan , Matthias Schunter , Michael Waidner, Optimistic protocols for fair exchange, Proceedings of the 4th ACM conference on Computer and communications security, p.7-17, April 01-04, 1997, Zurich, Switzerland
	Joe Kilian, More general completeness theorems for secure two-party computation, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.316-324, May 21-23, 2000, Portland, Oregon, United States
	Giovanni Di Crescenzo , Yuval Ishai , Rafail Ostrovsky, Non-interactive and non-malleable commitment, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.141-150, May 24-26, 1998, Dallas, Texas, United States
	Michael Ben-Or , Shafi Goldwasser , Joe Kilian , Avi Widgerson, Multi-prover interactive proofs: how to remove intractability assumptions, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.113-131, May 02-04, 1988, Chicago, Illinois, United States
	Silvio Micali, Simple and fast optimistic protocols for fair electronic exchange, Proceedings of the twenty-second annual symposium on Principles of distributed computing, p.12-19, July 13-16, 2003, Boston, Massachusetts
	Sheng Zhong , Yang Richard Yang, Verifiable distributed oblivious transfer and mobile agent security, Proceedings of the 2003 joint workshop on Foundations of mobile computing, p.12-21, September 19, 2003, San Diego, CA, USA
	Giuseppe Ateniese, Efficient verifiable encryption (and fair exchange) of digital signatures, Proceedings of the 6th ACM conference on Computer and communications security, p.138-146, November 01-04, 1999, Kent Ridge Digital Labs, Singapore
	Guilin Wang, An abuse-free fair contract signing protocol based on the RSA signature, Proceedings of the 14th international conference on World Wide Web, May 10-14, 2005, Chiba, Japan
	Yuval Ishai , Eyal Kushilevitz , Rafail Ostrovsky , Amit Sahai, Batch codes and their applications, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, USA
	David Woodruff , Jessica Staddon, Private inference control, Proceedings of the 11th ACM conference on Computer and communications security, October 25-29, 2004, Washington DC, USA
	Wen-Guey Tzeng, Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters, IEEE Transactions on Computers, v.53 n.2, p.232-240, February 2004
	Rolf Oppliger, Certified mail: the next challenge for secure messaging, Communications of the ACM, v.47 n.8, p.75-79, August 2004
	Danny Harnik , Moni Naor , Omer Reingold , Alon Rosen, Completeness in two-party secure computation: a computational view, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, USA
	Wakaha Ogata , Kaoru Kurosawa, Oblivious keyword search, Journal of Complexity, v.20 n.2-3, p.356-371, April/June 2004
	Matt Lepinski , Silvio Micali , Chris Peikert , Abhi Shelat, Completely fair SFE and coalition-safe cheap talk, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, July 25-28, 2004, St. John's, Newfoundland, Canada
	E. Aïmeur , G. Brassard , F. S. Mani Onana, Blind sales in electronic commerce, Proceedings of the 6th international conference on Electronic commerce, October 25-27, 2004, Delft, The Netherlands
	Giuseppe Ateniese, Verifiable encryption of digital signatures and applications, ACM Transactions on Information and System Security (TISSEC), v.7 n.1, p.1-20, February 2004
	Moni Naor, Cryptography and mechanism design, Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge, July 08-10, 2001, Siena, Italy
	Panagiotis Louridas, Some guidelines for non-repudiation protocols, ACM SIGCOMM Computer Communication Review, v.30 n.5, October 2000
	Wenjun Luo , Xiang Li, A study of secure multi-party elementary function computation protocols, Proceedings of the 3rd international conference on Information security, November 14-16, 2004, Shanghai, China
	Marta Kwiatkowska , Gethin Norman , David Parker, Probabilistic model checking in practice: case studies with PRISM, ACM SIGMETRICS Performance Evaluation Review, v.32 n.4, p.16-21, March 2005
	Benny Pinkas, Cryptographic techniques for privacy-preserving data mining, ACM SIGKDD Explorations Newsletter, v.4 n.2, p.12-19, December 2002
	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
	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
	Sheng Zhong , Yang Richard Yang, Verifiable distributed oblivious transfer and mobile agent security, Mobile Networks and Applications, v.11 n.2, p.201-210, April 2006
	Yusuke Okada , Yoshifumi Manabe , Tatsuaki Okamoto, An optimistic fair exchange protocol and its security in the universal composability framework, International Journal of Applied Cryptography, v.1 n.1, p.70-77, February 2008
	Ran Canetti , Ling Cheung , Dilsun Kaynar , Moses Liskov , Nancy Lynch , Olivier Pereira , Roberto Segala, Analyzing Security Protocols Using Time-Bounded Task-PIOAs, Discrete Event Dynamic Systems, v.18 n.1, p.111-159, March 2008
	Montri Apiromvorakarn , Yongyuth Permpoontanalarp, Undeniable fair exchange, Proceedings of the 6th WSEAS International Conference on Multimedia, Internet & Video Technologies, p.78-83, September 22-24, 2006, Lisbon, Portugal
	Michael Sirivianos , Jong Han Park , Xiaowei Yang , Stanislaw Jarecki, Dandelion: cooperative content distribution with robust incentives, 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference, p.1-14, June 17-22, 2007, Santa Clara, CA
	Joan Feigenbaum , Yuval Ishai , Tal Malkin , Kobbi Nissim , Martin J. Strauss , Rebecca N. Wright, Secure multiparty computation of approximations, ACM Transactions on Algorithms (TALG), v.2 n.3, p.435-472, July 2006
	Wan Haiping , He Huacan, Tools for privacy preserving Kernel methods in data mining, Proceedings of the 24th IASTED international conference on Artificial intelligence and applications, p.388-391, February 13-16, 2006, Innsbruck, Austria
	Oded Goldreich, Foundations of cryptography: a primer, Foundations and Trends® in Theoretical Computer Science, v.1 n.1, p.1-116, April 2005
	K. El-Khatib , G. v. Bochmann, Protecting the privacy of user's QoS preferences for multimedia applications, Proceedings of the 2nd ACM international workshop on Wireless multimedia networking and performance modeling, October 06-06, 2006, Terromolinos, Spain
	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
	Yuval Ishai , Eyal Kushilevitz , Yehuda Lindell , Erez Petrank, Black-box constructions for secure computation, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
	Boris Rozenberg , Ehud Gudes, Association rules mining in vertically partitioned databases, Data & Knowledge Engineering, v.59 n.2, p.378-396, November 2006
	Matthew Roughan , Yin Zhang, Privacy-preserving performance measurements, Proceedings of the 2006 SIGCOMM workshop on Mining network data, p.329-334, September 11-15, 2006, Pisa, Italy
	Dov S. Gordon , Hazay Carmit , Jonathan Katz , Yehuda Lindell, Complete fairness in secure two-party computation, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
	Zuhua Shao, Fair exchange protocol of signatures based on aggregate signatures, Computer Communications, v.31 n.10, p.1961-1969, June, 2008
	Yuval Ishai , Eyal Kushilevitz , Rafail Ostrovsky , Amit Sahai, Zero-knowledge from secure multiparty computation, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, June 11-13, 2007, San Diego, California, USA
	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
	Jonathan Katz, On achieving the "best of both worlds" in secure multiparty computation, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, June 11-13, 2007, San Diego, California, USA
	Esma Aïmeur , Gilles Brassard , Flavien Serge Mani Onana, Blind Electronic Commerce, Journal of Computer Security, v.14 n.6, p.535-559, November 2006
	Gethin Norman , Vitaly Shmatikov, Analysis of probabilistic contract signing, Journal of Computer Security, v.14 n.6, p.561-589, November 2006
	Guilin Wang, Generic non-repudiation protocols supporting transparent off-line TTP, Journal of Computer Security, v.14 n.5, p.441-467, September 2006
	Anthony J. Short , Nicolas Gisin , Sandu Popescu, The Physics of No-Bit-Commitment: Generalized Quantum Non-Locality Versus Oblivious Transfer, Quantum Information Processing, v.5 n.2, p.131-138, April 2006
	Josep Domingo-Ferrer , Jordi Herrera-Joancomartí, An anonymous electronic commerce scheme with an off-line authority and untrusted agents, ACM SIGMOD Record, v.27 n.4, p.62-67, Dec. 1998
	Konstantinos Chatzikokolakis , Catuscia Palamidessi, A framework for analyzing probabilistic protocols and its application to the Partial Secrets Exchange, Theoretical Computer Science, v.389 n.3, p.512-527, December, 2007
	Shan He , Renan G. Cattelan , Darko Kirovski, Modeling viral economies for digital media, ACM SIGOPS Operating Systems Review, v.42 n.4, May 2008
	Yuval Ishai , Eyal Kushilevitz , Rafail Ostrovsky , Amit Sahai, Cryptography with constant computational overhead, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
	Zhenjie Huang , Kefei Chen , Xuanzhi Lin , Rufen Huang, Analysis and Improvements of Two Identity-Based Perfect Concurrent Signature Schemes, Informatica, v.18 n.3, p.375-394, August 2007
	Constantin Popescu, An Improvement of the Ateniese's Verifiable Encryption Protocol, Informatica, v.16 n.1, p.121-130, January 2005
	Chris Peikert , Brent Waters, Lossy trapdoor functions and their applications, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
	Jaideep Vaidya , Murat Kantarcıoğlu , Chris Clifton, Privacy-preserving Naïve Bayes classification, The VLDB Journal — The International Journal on Very Large Data Bases, v.17 n.4, p.879-898, July 2008
	Assaf Ben-David , Noam Nisan , Benny Pinkas, FairplayMP: a system for secure multi-party computation, Proceedings of the 15th ACM conference on Computer and communications security, October 27-31, 2008, Alexandria, Virginia, USA
	Vipul Goyal , Steve Lu , Amit Sahai , Brent Waters, Black-box accountable authority identity-based encryption, Proceedings of the 15th ACM conference on Computer and communications security, October 27-31, 2008, Alexandria, Virginia, USA
	Khalil El-Khatib, The cost of protecting privacy in multimedia applications, Proceedings of the 4th ACM symposium on QoS and security for wireless and mobile networks, October 27-28, 2008, Vancouver, British Columbia, Canada
	Chin-Chen Chang , Jung-San Lee, Robust t-out-of-n oblivious transfer mechanism based on CRT, Journal of Network and Computer Applications, v.32 n.1, p.226-235, January, 2009
	Daisuke Inoue , Keisuke Tanaka, Conditional Converge Cast, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E91-A n.6, p.1537-1540, June 2008
	Jose A. Onieva , Jianying Zhou , Javier Lopez, Multiparty nonrepudiation: A survey, ACM Computing Surveys (CSUR), v.41 n.1, p.1-43, December 2008
	Wouter Teepe, On BAN logic and hash functions or: how an unjustified inference rule causes problems, Autonomous Agents and Multi-Agent Systems, v.19 n.1, p.76-88, August 2009
	Florian Kerschbaum , Daniel Dahlmeier , Axel Schröpfer , Debmalya Biswas, On the practical importance of communication complexity for secure multi-party computation protocols, Proceedings of the 2009 ACM symposium on Applied Computing, March 08-12, 2009, Honolulu, Hawaii
	Yuval Ishai , Tal Malkin , Martin J. Strauss , Rebecca N. Wright, Private multiparty sampling and approximation of vector combinations, Theoretical Computer Science, v.410 n.18, p.1730-1745, April, 2009

INDEX TERMS

Classification:
C. Computer Systems Organization
C.2 COMPUTER-COMMUNICATION NETWORKS

E. Data
E.3 DATA ENCRYPTION
Subjects: Public key cryptosystems; Data encryption standard (DES)**

H. Information Systems
H.4 INFORMATION SYSTEMS APPLICATIONS
H.4.3 Communications Applications
Subjects: Electronic mail

J. Computer Applications
J.1 ADMINISTRATIVE DATA PROCESSING
Subjects: Financial (e.g., EFTS)

General Terms:
Security, Theory, Verification

REVIEW

"Graham K. Jenkins : Reviewer"

The increasing acceptance of electronic mail as a business tool has revealed a few problems which have not been manifested in its nonelectronic counterpart. Thus, the signing of a contract between two parties necessitates the electronic exchange more...

Collaborative Colleagues:

Shimon Even: colleagues

Oded Goldreich: colleagues

Abraham Lempel: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player