Broadcast anonymous routing (BAR): scalable real-time anonymous communication

Kotzanikolaou, Panayiotis; Chatzisofroniou, George; Burmester, Mike

doi:10.1007/s10207-016-0318-0

Cited by 18 publications

(17 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed anonymous online evaluation protocol is based on known privacy primitives such as blind signatures [22], hash chains [23] and broadcast anonymous communication channels [24]. The protocol consists of four entities: the Student (or Evaluator) S, the Issuing Authority Server I, the Lecturer Server L and the Questionnaire Server Q.…”

Section: Protocol Descriptionmentioning

confidence: 99%

“…Therefore, the students only need a web browser to participate in the evaluation process. To simulate the anonymous communication channel in phases B and C we utilize the Broadcast Anonymous Routing (BAR) protocol [24] using a single Broadcast Anonymous Server [29] offering n-anonymity for the sender, since this is sufficient for our environment. Obviously students who are attending/evaluating a course disclose their identity to the lecturer/questionnaire server and their goal is to achieve sender n-anonymity when broadcasting their evaluations.…”

Section: System Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

Design and Implementation of an Anonymous and Secure Online Evaluation Protocol

et al. 2020

Self Cite

View full text Add to dashboard Cite

Course evaluations have become a common practice in most academic environments. To enhance participation, evaluations should be private and ensure a fair result. Related privacy-preserving method and technologies (e.g., anonymous credentials, Privacy Attribute-Based Credentials, and domain signatures) fail to address, at least in an obvious way, the minimal security and practicality requirements. In this paper, we propose, evaluate, and implement an efficient, anonymous evaluation protocol for academic environments. The protocol borrows ideas from well-known and efficient cryptographic approaches for anonymously submitting ballots in Internet elections for issuing one-time credentials and for anonymously broadcasting information. The proposed protocol extends the above approaches in order to provably satisfy properties such as the eligibility, privacy, fairness and verifiability of the evaluation system. Compared to the state of the art, our approach is less complex and more effective, while security properties of the proposed protocol are verified using the ProVerif cryptographic protocol verifier. A web-based implementation of the protocol has been developed and compared to other approaches and systems.

show abstract

Section: Protocol Descriptionmentioning

confidence: 99%

Section: System Evaluationmentioning

confidence: 99%

Design and Implementation of an Anonymous and Secure Online Evaluation Protocol

et al. 2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…The model defines an N-number group, and only one member is allowed to send messages in a given round. Messages are sent via broadcasting without the need for a trust center [17]. However, since the encryption process requires the cooperation of all members, it is vulnerable to internal dishonest members, and it is easy to break the security of the model [18].…”

Section: Introductionmentioning

confidence: 99%

LacminCC: Lightweight Anonymous Communication Model In Cloud Computing

Li¹,

Wang

Hong-wei

et al. 2021

Preprint

View full text Add to dashboard Cite

With increasing application of cloud computing and big data technologies, a large amount of personal information is stored on the Internet, which raises the issue of privacy leakage.To protect people's data privacy, this paper firstly presents a new anonymous Identify-Based Encryption (IBE) scheme and gives the proof of its security under the Bilinear Diffie-Hellman Security Assumption. Then, by introducing the anonymous IBE scheme into anonymous communication fields, this paper introduces a new lightweight anonymous communication model for cloud computing, which guarantees the anonymity of system users and the security of messages in small groups. Our analysis shows that, the proposed communication model cannot only reduce memory consumption and improve message transmission efficiency, but also effectively resist traffic-analysis attacks, node eavesdropping, and finally achieve secure anonymous communication in cloud computing.

show abstract

“…Compared to the systems based on single-agent, this type of systems could obtain more anonymity. Anonymous systems based on multicast/broadcast include DC-Net [6], SAM [7], P5 [5], Herbivore [8], K-Anonymity [9], M2 [10], MAM [11], Dissent [12], [13], and BAR [14].…”

Section: Introductionmentioning

confidence: 99%

A Survey on Measuring Anonymity in Anonymous Communication Systems

Wang

2019

IEEE Access

View full text Add to dashboard Cite

The popularity of Internet applications has made communication privacy an increasingly important security requirement. As an important aspect of privacy, anonymity ensures that a subject may use resources or services without disclosing user identity or corresponding relationships. Since the seminal work by Chaum for anonymous communication, many different anonymous communication systems, and anonymous protocols have been developed and investigated extensively. In recent years, anonymous communication systems have evolved from academic tools used by specialists to mass-market software used by millions of ordinary people. How to evaluate and quantify the anonymity that different anonymous communication systems can offer has been a new focus. Though some efforts have been made on anonymity metrics and measuring techniques, systematic research on measuring anonymity of anonymous communication systems is still needed. In this paper, we give a comprehensive overview of state-of-the-art research on measuring anonymity. We first summarize the anonymous mechanisms applied by different anonymous systems. We then introduce the formalization of the notion of anonymity for measuring the anonymity degree. Further, metrics based on various theories and approaches are reviewed. We particularly elaborate on the metrics based on information theory as a separate section because of its popularity and multiple branches. The metrics based on information entropy is probably of the greatest interest.

show abstract

Broadcast anonymous routing (BAR): scalable real-time anonymous communication

Cited by 18 publications

References 24 publications

Design and Implementation of an Anonymous and Secure Online Evaluation Protocol

Design and Implementation of an Anonymous and Secure Online Evaluation Protocol

LacminCC: Lightweight Anonymous Communication Model In Cloud Computing

A Survey on Measuring Anonymity in Anonymous Communication Systems

Contact Info

Product

Resources

About