NDLI: Incoercible multiparty computation

Content Provider	IEEE Xplore Digital Library
Author	Canetti, R. Gennaro, R.
Copyright Year	1996
Description	Author affiliation: Lab. for Comput. Sci., MIT, Cambridge, MA, USA (Canetti, R.)
Abstract	Current secure multiparty protocols have the following deficiency. The public transcript of the communication can be used as an involuntary commitment of the parties to their inputs and outputs. Thus parties can be later coerced by some authority to reveal their private data. Previous work that has pointed this interesting problem out contained only partial treatment. The authors present the first general treatment of the coercion problem in secure computation. They first present a general definition of protocols that provide resilience to coercion. Their definition constitutes a natural extension of the general paradigm used for defining secure multiparty protocols. They next show that if trapdoor permutations exist then any function can be incoercibly computed (i.e., computed by a protocol that provides resilience to coercion) in the presence of computationally bounded adversaries and only public communication channels. This holds as long as less than half the parties are coerced (or corrupted). In particular, theirs are the first incoercible protocols without physical security assumptions. Also, the protocols constitute an alternative solution to the recently solved adaptive security problem. Their techniques are quite surprising and include non-standard use of deniable encryptions.
Starting Page	504
Ending Page	513
File Size	1136787
Page Count	10
File Format	PDF
ISBN	0818675942
ISSN	02725428
DOI	10.1109/SFCS.1996.548509
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1996-10-14
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Protocols Communication channels Resilience Voting Radio access networks Cryptography Privacy Data security Communication system control Computer science
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Rational secure computation and ideal mechanism design

Efficient Multiparty Computation for Comparator Networks

Towards a Framework on the Security Requirements for Electronic Voting Protocols

Verifiable secret sharing and multiparty protocols in distributed systems

Performance Evaluation of Privacy-Preserving Policy Reconciliation Protocols

Incoercible secure electronic voting scheme based on chaffing and winnowing

Analysis of Data in Secure Multiparty Computation

Pseudo-Voter Identity (PVID) Scheme for e-Voting Protocols

Relating cryptography and cryptographic protocols

Incoercible multiparty computation

Similar Documents

Rational secure computation and ideal mechanism design

Efficient Multiparty Computation for Comparator Networks

Towards a Framework on the Security Requirements for Electronic Voting Protocols

Verifiable secret sharing and multiparty protocols in distributed systems

Performance Evaluation of Privacy-Preserving Policy Reconciliation Protocols

Incoercible secure electronic voting scheme based on chaffing and winnowing

Analysis of Data in Secure Multiparty Computation

Pseudo-Voter Identity (PVID) Scheme for e-Voting Protocols

Relating cryptography and cryptographic protocols

Incoercible multiparty computation