Abstract

In online surveys, many people are reluctant 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 an IND-CCA2 secure cryptosystem. In the end, the message sender's identities are protected since no one knows the message submission order. These approaches cannot efficiently handle groups of large size. In this paper, we propose an efficient anonymous message submission protocol aimed at a practical group size. Our protocol is based on a secret sharing scheme and a symmetric key cryptosystem. We propose a novel method to aggregate members' messages into a message vector such that a group member knows only his own position in the submission sequence. The protocol is accountable for capturing malicious members breaking the protocol execution. We provide a theoretical proof showing that our protocol is anonymous under malicious attacks. We also discuss our simulation results to demonstrate the efficiency of our protocol.

Original languageEnglish (US)
Pages (from-to)217-230
Number of pages14
JournalIEEE Transactions on Dependable and Secure Computing
Volume15
Issue number2
DOIs
StatePublished - Mar 1 2018

Fingerprint

Cryptography

Keywords

  • accountablility
  • anonymity
  • Group messaging submission
  • identity protection
  • secret sharing scheme

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Efficient Anonymous Message Submission. / Zhao, Xinxin; Li, Lingjun; Xue, Guoliang; Ahn, Gail-Joon.

In: IEEE Transactions on Dependable and Secure Computing, Vol. 15, No. 2, 01.03.2018, p. 217-230.

Research output: Contribution to journalArticle

@article{5db80954e2104c9497c0b5517edc4371,
title = "Efficient Anonymous Message Submission",
abstract = "In online surveys, many people are reluctant 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 an IND-CCA2 secure cryptosystem. In the end, the message sender's identities are protected since no one knows the message submission order. These approaches cannot efficiently handle groups of large size. In this paper, we propose an efficient anonymous message submission protocol aimed at a practical group size. Our protocol is based on a secret sharing scheme and a symmetric key cryptosystem. We propose a novel method to aggregate members' messages into a message vector such that a group member knows only his own position in the submission sequence. The protocol is accountable for capturing malicious members breaking the protocol execution. We provide a theoretical proof showing that our protocol is anonymous under malicious attacks. We also discuss our simulation results to demonstrate the efficiency of our protocol.",
keywords = "accountablility, anonymity, Group messaging submission, identity protection, secret sharing scheme",
author = "Xinxin Zhao and Lingjun Li and Guoliang Xue and Gail-Joon Ahn",
year = "2018",
month = "3",
day = "1",
doi = "10.1109/TDSC.2016.2556659",
language = "English (US)",
volume = "15",
pages = "217--230",
journal = "IEEE Transactions on Dependable and Secure Computing",
issn = "1545-5971",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Efficient Anonymous Message Submission

AU - Zhao, Xinxin

AU - Li, Lingjun

AU - Xue, Guoliang

AU - Ahn, Gail-Joon

PY - 2018/3/1

Y1 - 2018/3/1

N2 - In online surveys, many people are reluctant 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 an IND-CCA2 secure cryptosystem. In the end, the message sender's identities are protected since no one knows the message submission order. These approaches cannot efficiently handle groups of large size. In this paper, we propose an efficient anonymous message submission protocol aimed at a practical group size. Our protocol is based on a secret sharing scheme and a symmetric key cryptosystem. We propose a novel method to aggregate members' messages into a message vector such that a group member knows only his own position in the submission sequence. The protocol is accountable for capturing malicious members breaking the protocol execution. We provide a theoretical proof showing that our protocol is anonymous under malicious attacks. We also discuss our simulation results to demonstrate the efficiency of our protocol.

AB - In online surveys, many people are reluctant 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 an IND-CCA2 secure cryptosystem. In the end, the message sender's identities are protected since no one knows the message submission order. These approaches cannot efficiently handle groups of large size. In this paper, we propose an efficient anonymous message submission protocol aimed at a practical group size. Our protocol is based on a secret sharing scheme and a symmetric key cryptosystem. We propose a novel method to aggregate members' messages into a message vector such that a group member knows only his own position in the submission sequence. The protocol is accountable for capturing malicious members breaking the protocol execution. We provide a theoretical proof showing that our protocol is anonymous under malicious attacks. We also discuss our simulation results to demonstrate the efficiency of our protocol.

KW - accountablility

KW - anonymity

KW - Group messaging submission

KW - identity protection

KW - secret sharing scheme

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

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

U2 - 10.1109/TDSC.2016.2556659

DO - 10.1109/TDSC.2016.2556659

M3 - Article

AN - SCOPUS:85043760306

VL - 15

SP - 217

EP - 230

JO - IEEE Transactions on Dependable and Secure Computing

JF - IEEE Transactions on Dependable and Secure Computing

SN - 1545-5971

IS - 2

ER -