Dissent: Accountable Anonymous Group Messaging

被引:87
作者
Corrigan-Gibbs, Henry [1 ]
Ford, Bryan [1 ]
机构
[1] Yale Univ, Dept Comp Sci, POB 2158, New Haven, CT 06520 USA
来源
PROCEEDINGS OF THE 17TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'10) | 2010年
基金
美国国家科学基金会;
关键词
Anonymity; Accountability; Denial of Service; Group Communication; Peer-to-Peer Networks; Verifiable Anonymous Shuffle; INTERNET;
D O I
10.1145/1866307.1866346
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Users often wish to participate in online groups anonymously, but misbehaving users may abuse this anonymity to disrupt the group's communication. Existing messaging protocols such as DC-nets leave groups vulnerable to denial-of-service and Sybil attacks, Mixnets are difficult to protect against traffic analysis, and accountable voting protocols are unsuited to general anonymous messaging. We present the first general messaging protocol that offers provable anonymity with accountability for moderate-size groups, and efficiently handles unbalanced loads where few members wish to transmit in a given round. The N group members first cooperatively shuffle an N x N matrix of pseudorandom seeds, then use these seeds in N "pre-planned" DC-nets protocol runs. Each DCnets run transmits the variable-length bulk data comprising one member's message, using the minimum number of bits required for anonymity under our attack model. The protocol preserves message integrity and one-to-one correspondence between members and messages, makes denial-of-service attacks by members traceable to the culprit, and efficiently handles large, unbalanced message loads. A working prototype demonstrates the protocol's practicality for anonymous messaging in groups of 4 0 + members.
引用
收藏
页码:340 / 350
页数:11
相关论文
共 41 条
[1]  
[Anonymous], 2005, Cryptography: Theory and Practice
[2]  
[Anonymous], 2002, 1 INT WORKSH PEER TO
[3]  
[Anonymous], 2004, P 13 C USENIX SEC S, DOI [DOI 10.5555/1251375.1251396, DOI 10.1186/1476-0711-3-21]
[4]  
[Anonymous], 2003, P 10 ACM C COMP COMM
[5]  
[Anonymous], 2007, NY TIMES
[6]  
[Anonymous], 1961, The Yale Law Journal, V70, P1084, DOI DOI 10.2307/794351?REF=SEARCH-GATEWAY:25503CF11024A2CA9E983E06AF9B2DC9
[7]  
Bellare M., 1998, LECT NOTES COMPUTER, V1462, P549
[8]  
Ben Adida, 2006, THESIS
[9]  
Berthold Oliver, 2000, WORKSH DES ISS AN UB
[10]  
Boneh D., 2004, CRYPTO