Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,400,058 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.
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
2011
2011
Doubly-Anonymous Crowds: Using Secret-Sharing to achieve Sender- and Receiver-Anonymity
S. Rass
,
R. Wigoutschnigg
,
P. Schartner
J. Wirel. Mob. Networks Ubiquitous Comput…
2011
Corpus ID: 16108626
Anonymous communication is usually achieved by using overlay networks and public-key cryptography. Besides well-established…
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
2008
2008
Analysis, Improvement, and Simplification of Prêt à Voter with Paillier Encryption
Zhe Xia
,
Steve A. Schneider
,
J. Heather
,
Jacques Traoré
USENIX Workshop on Accurate Electronic Voting…
2008
Corpus ID: 15168811
In this paper, we analyse information leakage in Ryan's Pret a Voter with Paillier encryption scheme (PAV-Paillier). Our analysis…
Expand
2008
2008
Batch Processing for Proofs of Partial Knowledge and Its Applications
Koji Chida
,
G. Yamamoto
IEICE Transactions on Fundamentals of Electronics…
2008
Corpus ID: 42676491
This paper presents batch processing protocols for efficiently proving a great deal of partial knowledge. These protocols reduce…
Expand
2007
2007
Efficient Multiparty Computation for Comparator Networks
Koji Chida
,
H. Kikuchi
,
Gembu Morohashi
,
K. Hirota
ARES
2007
Corpus ID: 8648898
We propose a multiparty protocol for various computations using comparator networks such as sorting and searching. By repeating…
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
Review
2005
Review
2005
Zero-Knowledge Proofs for Mix-nets of Secret Shares and a Version of ElGamal with Modular Homomorphism
M. Silaghi
IACR Cryptology ePrint Archive
2005
Corpus ID: 6419897
Mix-nets can be used to shuffle vectors of shared secrets. This operation can be an important building block for solving…
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