[1] |
CHAUM D . Untraceable electronic mail,return addresses,and digital pseudonyms[J]. Communications of the ACM, 1981,24(2): 84-88.
|
[2] |
DINGLEDINE R , MATHEWSON N , SYVERSON P . Tor:the second-generation onion router[A]. Proceedings of the 13th USENIX Security Symposium[C]. San Antonio,USA, 2004. 303-320.
|
[3] |
DEMIREL D , HENNING M , VANDEGRAAF J ,et al. Prêt à voter providing everlasting privacy[A]. Proceedings of the 4th International Conference on E-Voting and Identity[C]. Guildford,UK, 2013. 156-175.
|
[4] |
YI X , OKAMOTO E . Practical Internet voting system[J]. Journal of Network and Computer Applications, 2013,36(1): 378-387.
|
[5] |
GABBER E , BIBBONS P , MATIAS Y . How to make personalized Web browsing simple,secure,and anonymous[A]. Financial Cryptography ’97[C]. Anguilla,UK, 1997. 17-31.
|
[6] |
JAKOBSSON M , RAIHI D . Mix-based electronic payments[A]. Proceedings of SAC ’98[C]. London,UK, 1998. 157-173.
|
[7] |
JAKOBSSON M . Flash mixing[A]. Proceedings of PODC ’99[C]. Atlanta,Georgia,USA, 1999. 83-89.
|
[8] |
JAKOBSSON M , JUELS A . An optimally robust hybrid mix network[A]. Twentieth ACM Symposium on Principles of Distributed Computing[C]. New York,NY,USA, 2001. 284-292.
|
[9] |
GOLLE P , ZHONG S , BONEH D ,et al. Optimistic mixing for exit-polls[A]. Advances in Cryptology-Asiacrypt ’02[C]. Queenstown,New Zealand, 2002. 451-465.
|
[10] |
WIKSTR?M D . A sender verifiable mix-net and a new proof of a shuffle[A]. Advances in Cryptology-Asiacrypt ’05[C]. Chennai,India, 2005. 273-292.
|
[11] |
ABE M . Flaws in robust optimistic mix-nets and stronger security notions[J]. IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences, 2006,89(1): 99-105.
|
[12] |
WIKSTR?M D . Five practical attacks for “optimistic mixing for exit-polls”[A]. Proceedings of Selected Areas of Cryptography(SAC)[C]. Ottawa Canada, 2003. 160-174.
|
[13] |
MITOMO M , KUROSAWA K . Attack for flash mix[A]. Proceedings of ASIACRYPT 2000[C]. Kyoto,Japan, 2000. 192-204.
|
[14] |
LI L H , FU S F , CHE X Q . A new relation attack on the optimistic mix-net[A]. International Symposium on Computer Network and Multimedia Technology(CNMT 2009)[C]. Wuhan,China, 2009. 1-4.
|
[15] |
PENG K . Failure of a mix network[J]. International Journal of Network Security & Its Applications, 2011,3(1): 81-97.
|
[16] |
WIKSTR?M D . A universally composable mix-net[A]. 1st Theory of Cryptography Conference[C]. 2004. 315-335.
|
[17] |
WIKSTR?M D , GROTH J . An adaptively secure mix-net without erasures[A]. 33rd International Colloquium on Automata,Languages and Programming[C]. 2006. 276-287.
|
[18] |
CAMENISCH J , MITYAGIN A . Mix-network with stronger security[A]. 5th International Workshop on Privacy Enhancing Technologies[C]. Cavtat,Croatia, 2005. 128-146.
|
[19] |
KHAZAEI S , MORAN T,WIKSTR?M D . A mix-net from any CCA2 secure cryptosystem[A]. Advances in Cryptology – ASIACRYPT 2012[C]. Beijing,China, 2012. 607-625.
|
[20] |
JAKOBSSON M , JUELS A , RIVEST R . Making mix nets robust for electronic voting by randomized partial checking[A]. Proceedings of USENIX'02[C]. San Francisco,USA, 2002. 339-353.
|
[21] |
FURUKAWA J , SAKO K . An efficient scheme for proving a shuffle[A]. Advances in Cryptology- Crypto’01[C]. Santa Barbara,California,USA, 2001. 368-387.
|
[22] |
NEFF A . A verifiable secret shuffle and its application to E-Voting[A]. Proceedings of ACM CCS ’01[C]. Philadelphia,Pennsylvania,USA, 2001. 116-125.
|
[23] |
GROTH J . A verifiable secret shuffle of homomorphic encryptions[J]. Journal of Cryptology, 2010,23(4): 546-579.
|
[24] |
CANETTI R . Universally composable security:a new paradigm for cryptographic protocols[A]. 42nd IEEE Symposium on Foundations of Computer Science[C]. NY,USA, 2001. 136-145.
|
[25] |
BELLARE M , ROGAWAY P . Random oracles are practical:a paradigm for designing efficient protocols[A]. Proceedings of ACM CCS’ 93[C]. Fairfax,Virginia,USA, 1993. 62-73.
|
[26] |
FIAT A , SHAMIR A . How to prove yourself:practical solutions to identification and signature problems[A]. CRYPTO 1986[C]. 1986. 186-194.
|
[27] |
PEDERSEN P . Non-interactive and information theoretic secure verifiable secret sharing[A]. Advances in Cryptology-Crypto'91[C]. Santa Barbara,California,USA, 1991. 129-140.
|
[28] |
DOLEV D , STRONG H . Authenticated algorithms for byzantine agreement[J]. SIAM Journal on Computing, 1983,12(4): 656-666.
|
[29] |
SHOUP V , GENNARO R . Securing threshold cryptosystems against chosen ciphertext attack[J]. Journal of Cryptology, 2002,15(2): 75-96.
|
[30] |
KHAZAEI S,WIKSTR?M D . Randomized partial checking Revisited[A]. Proceedings of the 13th International Conference on Topics in Cryptology[C]. San Francisco,CA,February, 2013. 115-128.
|
[31] |
KüSTERS R , TRUDERUNG T , VOGT A . Formal analysis of chaumian mix nets with randomized partial checking[A]. Proceedings of the 2014 IEEE Symposium on Security and Privacy[C]. Washington,DC,USA, 2014. 343-358.
|