Skip to search formSkip to main contentSkip to account menu

Dining cryptographers problem

Known as: Dining cryptographer, DC-Net, Dining cryptographer protocol 
In cryptography, the dining cryptographers problem studies how to perform a secure multi-party computation of the boolean-OR function. David Chaum… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Anonymous veto networkCryptographic hash functionDiffie–Hellman key exchangeDining philosophers problem

Broader (1)

Cryptography

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Storage Optimization for Non Interactive Dining Cryptographers (NIDC)
In many applications, such as e-voting, it is imperative that the privacy scope unconditional security levels, i.e. that it is… 
2014
2014
Beating the Birthday Paradox in Dining Cryptographer Networks
A Dining Cryptographer Network (DC-Net) allows multiple players to broadcast messages without disclosing the identity of the… 
2014
2014
Implementación de canales paralelos en un protocolo Non Interactive Dining Cryptographers
1 Departamento de Matematica Universidad Nacional de La Pampa Av. Uruguay 151(6300) Santa Rosa La Pampa Argentina {pablogarcia… 
2014
2014
Automatically Calculating Quantitative Integrity Measures for Imperative Programs
This paper presents a framework for calculating measures of data integrity for programs in a small imperative language. We… 
2014
2014
Dining Cryptographers are Practical (preliminary version)
The dining cryptographers protocol provides information-theoretically secure sender and recipient untraceability. However, the… 
2013
2013
Modularity and Openness in Modeling Multi-Agent Systems
We revisit the formalism of modular interpreted systems (MIS) which encourages modular and open modeling of synchronous multi… 
2013
2013
Manejo de colisiones en un protocolo Non Interactive Dining Cryptographers
1 Departamento de Ciência da Computação Universidade Federal de Minas Gerais Av. Antonio Carlos, 6627 – 31270-010 Belo Horizonte… 
2010
2010
Self-adaptive Change Detection in Streaming Data with Non-stationary Distribution
Non-stationary distribution, in which the data distribution evolves over time, is a common issue in many application fields, e.g… 
2007
2007
Dining Cryptographers The Protocol
What are dining cryptographer networks? How and why do they work? And why is there still no real implementation available? Back… 
2007
2007
Acimn protocol: A protocol for anonymous communication in multi hop wireless networks
Summary form only given. Anonymity is the state of not being identifiable within a set of subjects. Different strategies exist… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)