Information-theoretic security without an honest majority

Details Information-theoretic security without an honest majority Information-theoretic security without an honest majority

2007-06-13

arxiv.org/abs/0706.2010v1

Proceedings of ASIACRYPT 2007 pp. 410-426

Computer Science

Cryptography and Security

15 pages, to appear in Proceedings of ASIACRYPT 2007

Scientific paper

We present six multiparty protocols with information-theoretic security that tolerate an arbitrary number of corrupt participants. All protocols assume pairwise authentic private channels and a broadcast channel (in a single case, we require a simultaneous broadcast channel). We give protocols for veto, vote, anonymous bit transmission, collision detection, notification and anonymous message transmission. Not assuming an honest majority, in most cases, a single corrupt participant can make the protocol abort. All protocols achieve functionality never obtained before without the use of either computational assumptions or of an honest majority.

Affiliated with

Also associated with

No associations

Rating

Information-theoretic security without an honest majority does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Information-theoretic security without an honest majority, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information-theoretic security without an honest majority will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-330355