Efficient anonymous message submission

Xinxin Zhao, Lingjun Li, Guoliang Xue, Gabriel Silva

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

In online surveys, many people are not willing to provide true answers due to privacy concerns. Thus, anonymity is important for online message collection. Existing solutions let each member blindly shuffle the submitted messages by using the IND-CCA2 secure cryptosystem. In the end, all messages are randomly shuffled and no one knows the message order. However, the heavy computational overhead and linear communication rounds make it only useful for small groups. In this paper, we propose an efficient anonymous message submission protocol aimed at a practical group size. Our protocol is based on a simplified secret sharing scheme and a symmetric key cryptosystem. We propose a novel method to let all members secretly aggregate their messages into a message vector such that a member knows nothing about other members' message positions.We provide a theoretical proof showing that our protocol is anonymous under malicious attacks. We then conduct a thorough analysis of our protocol, showing that our protocol is computationally more efficient than existing solutions and results in a constant communication rounds with a high probability.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages2228-2236
Number of pages9
DOIs
StatePublished - 2012
EventIEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States
Duration: Mar 25 2012Mar 30 2012

Other

OtherIEEE Conference on Computer Communications, INFOCOM 2012
CountryUnited States
CityOrlando, FL
Period3/25/123/30/12

Fingerprint

Cryptography
Communication

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Zhao, X., Li, L., Xue, G., & Silva, G. (2012). Efficient anonymous message submission. In Proceedings - IEEE INFOCOM (pp. 2228-2236). [6195608] https://doi.org/10.1109/INFCOM.2012.6195608

Efficient anonymous message submission. / Zhao, Xinxin; Li, Lingjun; Xue, Guoliang; Silva, Gabriel.

Proceedings - IEEE INFOCOM. 2012. p. 2228-2236 6195608.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhao, X, Li, L, Xue, G & Silva, G 2012, Efficient anonymous message submission. in Proceedings - IEEE INFOCOM., 6195608, pp. 2228-2236, IEEE Conference on Computer Communications, INFOCOM 2012, Orlando, FL, United States, 3/25/12. https://doi.org/10.1109/INFCOM.2012.6195608
Zhao X, Li L, Xue G, Silva G. Efficient anonymous message submission. In Proceedings - IEEE INFOCOM. 2012. p. 2228-2236. 6195608 https://doi.org/10.1109/INFCOM.2012.6195608
Zhao, Xinxin ; Li, Lingjun ; Xue, Guoliang ; Silva, Gabriel. / Efficient anonymous message submission. Proceedings - IEEE INFOCOM. 2012. pp. 2228-2236
@inproceedings{bb42aa58abe842208e50ed7848f6cdbc,
title = "Efficient anonymous message submission",
abstract = "In online surveys, many people are not willing to provide true answers due to privacy concerns. Thus, anonymity is important for online message collection. Existing solutions let each member blindly shuffle the submitted messages by using the IND-CCA2 secure cryptosystem. In the end, all messages are randomly shuffled and no one knows the message order. However, the heavy computational overhead and linear communication rounds make it only useful for small groups. In this paper, we propose an efficient anonymous message submission protocol aimed at a practical group size. Our protocol is based on a simplified secret sharing scheme and a symmetric key cryptosystem. We propose a novel method to let all members secretly aggregate their messages into a message vector such that a member knows nothing about other members' message positions.We provide a theoretical proof showing that our protocol is anonymous under malicious attacks. We then conduct a thorough analysis of our protocol, showing that our protocol is computationally more efficient than existing solutions and results in a constant communication rounds with a high probability.",
author = "Xinxin Zhao and Lingjun Li and Guoliang Xue and Gabriel Silva",
year = "2012",
doi = "10.1109/INFCOM.2012.6195608",
language = "English (US)",
isbn = "9781467307758",
pages = "2228--2236",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Efficient anonymous message submission

AU - Zhao, Xinxin

AU - Li, Lingjun

AU - Xue, Guoliang

AU - Silva, Gabriel

PY - 2012

Y1 - 2012

N2 - In online surveys, many people are not willing to provide true answers due to privacy concerns. Thus, anonymity is important for online message collection. Existing solutions let each member blindly shuffle the submitted messages by using the IND-CCA2 secure cryptosystem. In the end, all messages are randomly shuffled and no one knows the message order. However, the heavy computational overhead and linear communication rounds make it only useful for small groups. In this paper, we propose an efficient anonymous message submission protocol aimed at a practical group size. Our protocol is based on a simplified secret sharing scheme and a symmetric key cryptosystem. We propose a novel method to let all members secretly aggregate their messages into a message vector such that a member knows nothing about other members' message positions.We provide a theoretical proof showing that our protocol is anonymous under malicious attacks. We then conduct a thorough analysis of our protocol, showing that our protocol is computationally more efficient than existing solutions and results in a constant communication rounds with a high probability.

AB - In online surveys, many people are not willing to provide true answers due to privacy concerns. Thus, anonymity is important for online message collection. Existing solutions let each member blindly shuffle the submitted messages by using the IND-CCA2 secure cryptosystem. In the end, all messages are randomly shuffled and no one knows the message order. However, the heavy computational overhead and linear communication rounds make it only useful for small groups. In this paper, we propose an efficient anonymous message submission protocol aimed at a practical group size. Our protocol is based on a simplified secret sharing scheme and a symmetric key cryptosystem. We propose a novel method to let all members secretly aggregate their messages into a message vector such that a member knows nothing about other members' message positions.We provide a theoretical proof showing that our protocol is anonymous under malicious attacks. We then conduct a thorough analysis of our protocol, showing that our protocol is computationally more efficient than existing solutions and results in a constant communication rounds with a high probability.

UR - http://www.scopus.com/inward/record.url?scp=84861631303&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84861631303&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2012.6195608

DO - 10.1109/INFCOM.2012.6195608

M3 - Conference contribution

AN - SCOPUS:84861631303

SN - 9781467307758

SP - 2228

EP - 2236

BT - Proceedings - IEEE INFOCOM

ER -