Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,425,490 papers from all fields of science
Search
Sign In
Create Free Account
Mix network
Known as:
Mix
, Mix networks
, Mix net
Expand
Mix networks are routing protocols that create hard-to-trace communications by using a chain of proxy servers known as mixes which take in messages…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Anonymous blog
Bitpost
Cryptographic primitive
Degree of anonymity
Expand
Broader (4)
Crypto-anarchism
Cryptography
Internet privacy
Secure communication
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Distributed Differential Privacy via Mixnets
Albert Cheu
,
Adam D. Smith
,
Jonathan Ullman
,
David Zeber
,
M. Zhilyaev
arXiv.org
2018
Corpus ID: 195347797
We consider the problem of designing scalable, robust protocols for computing statistics about sensitive data. Specifically, we…
Expand
2015
2015
An Incoercible E-Voting Scheme Based on Revised Simplified Verifiable Re-encryption Mix-nets
S. Tamura
,
H. A. Haddad
,
Nazmul Islam
,
Kazi Md. Rokibul Alam
arXiv.org
2015
Corpus ID: 7427526
Simplified verifiable re-encryption mix-net (SVRM) is revised and a scheme for e-voting systems is developed based on it. The…
Expand
2013
2013
Visual analytics for intrusion detection in spam emails
Jinson Zhang
,
M. Huang
,
D. Hoang
International Journal of Grid and Utility…
2013
Corpus ID: 7618251
Spam email attacks are increasing at an alarming rate and have become more and more cunning in nature. This has necessitated the…
Expand
2012
2012
Watermarking in e-voting for large scale election
Yousfi Souheib
,
Derrode Stephane
,
Robbana Riadh
International Conference on Multimedia Computing…
2012
Corpus ID: 16330426
Coercion resistance is the most effective property to fight coercive attacks in Internet elections. This notion was introduced by…
Expand
Highly Cited
2009
Highly Cited
2009
PAPER www.rsc.org/softmatter | Soft Matter
2009
Corpus ID: 13782872
2008
2008
On the anonymity of Chaum mixes
P. Venkitasubramaniam
,
Parvathinathan Anantharam
IEEE International Symposium on Information…
2008
Corpus ID: 1549535
The information-theoretic analysis of Chaum mixing under latency constraints is considered. Mixes are relay nodes that collect…
Expand
2005
2005
A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem
L. Nguyen
,
R. Safavi-Naini
,
K. Kurosawa
Journal of universal computer science (Online)
2005
Corpus ID: 6984611
We propose a variant of the Paillier cryptosystem that improves efficiency in encryption, re-encryption and decryption while…
Expand
2005
2005
Obfuscated Ciphertext Mixing
B. Adida
,
Douglas Wikström
2005
Corpus ID: 6028248
Mixnets are a type of anonymous channel composed of a handful of trustees that, each in turn, shuffle and rerandomize a batch…
Expand
2005
2005
A novel mix-based location privacy mechanism in Mobile IPv6
Jun Jiang
,
Chen He
,
Ling-ge Jiang
Computers & security
2005
Corpus ID: 38680463
2003
2003
Flaws in Some Robust Optimistic Mix-Nets
Masayuki Abe
,
H. Imai
Australasian Conference on Information Security…
2003
Corpus ID: 2853427
This paper introduces weaknesses of two robust Mix-nets proposed in [10] and [7]. First, we show that [10] can lose anonymity in…
Expand
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)
ACCEPT & CONTINUE