In electronic voting or whistle blowing, anonymity is necessary. Shuffling is a network security technique that makes the information sender anonymous. We use the concept of shuffling in internet-based lotteries, mental poker, E-commerce systems, and Mix-Net. However, if the shuffling is unjust, the anonymity, privacy, or fairness may be compromised. In this paper, we propose the method for confirming fair mixing by finding a fixed point in the mix system and we can keep the details on ‘how to shuffle’ secret. This method requires only two steps and is efficient
We show how to public-key obfuscate two commonly used shuffles: decryption shuffles which permute an...
Abstract. In secure multi-party shuffling, multiple parties, each holding an input, want to agree on...
A weighted voting is a voting such that votes are tallied in proportion to voters ’ own weights. An ...
Abstract. We show how to obfuscate a secret shuffle of ciphertexts: shuffling becomes a public opera...
Abstract—Shuffling is an effective method to build a publicly verifiable mix network to implement ve...
In order to guarantee a fair and transparent voting process, electronic voting schemes must be verif...
We study the question of how to shuffle n cards when faced with an opponent who knows the initial po...
© 2012 Kim RamchenCryptographic mixnets are a fundamental tool in the construction of secure electro...
In this paper we present the first fully post-quantum proof of a shuffle for RLWE encryption schemes...
A verifiable shuffle of known values is a method for proving that a collection of commitments opens ...
In TCC 2007, Adida and Wikström proposed a novel approach to shuffle, called a public shuffle, in wh...
2020, Springer Nature Switzerland AG. In this paper, we propose a new commitment key generation meth...
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted o...
In an electronic voting procedure, mixing networks are used to ensure anonymity of the casted votes....
We study a protocol for distributed computation called shuffled check-in, which achieves strong priv...
We show how to public-key obfuscate two commonly used shuffles: decryption shuffles which permute an...
Abstract. In secure multi-party shuffling, multiple parties, each holding an input, want to agree on...
A weighted voting is a voting such that votes are tallied in proportion to voters ’ own weights. An ...
Abstract. We show how to obfuscate a secret shuffle of ciphertexts: shuffling becomes a public opera...
Abstract—Shuffling is an effective method to build a publicly verifiable mix network to implement ve...
In order to guarantee a fair and transparent voting process, electronic voting schemes must be verif...
We study the question of how to shuffle n cards when faced with an opponent who knows the initial po...
© 2012 Kim RamchenCryptographic mixnets are a fundamental tool in the construction of secure electro...
In this paper we present the first fully post-quantum proof of a shuffle for RLWE encryption schemes...
A verifiable shuffle of known values is a method for proving that a collection of commitments opens ...
In TCC 2007, Adida and Wikström proposed a novel approach to shuffle, called a public shuffle, in wh...
2020, Springer Nature Switzerland AG. In this paper, we propose a new commitment key generation meth...
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted o...
In an electronic voting procedure, mixing networks are used to ensure anonymity of the casted votes....
We study a protocol for distributed computation called shuffled check-in, which achieves strong priv...
We show how to public-key obfuscate two commonly used shuffles: decryption shuffles which permute an...
Abstract. In secure multi-party shuffling, multiple parties, each holding an input, want to agree on...
A weighted voting is a voting such that votes are tallied in proportion to voters ’ own weights. An ...