How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
A note on efficient zero-knowledge proofs and arguments (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
SIAM Journal on Computing
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Verifiable Secret Shuffle of Homomorphic Encryptions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
On the (In)security of the Fiat-Shamir Paradigm
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Short PCPs Verifiable in Polylogarithmic Time
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Shufle for Paillier's Encryption Scheme
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Strengthening Zero-Knowledge Protocols Using Signatures
Journal of Cryptology
International Journal of Information Security
The PCP theorem by gap amplification
Journal of the ACM (JACM)
Efficient Arguments without Short PCPs
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient concurrent zero-knowledge in the auxiliary string model
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Verifiable shuffle of large size ciphertexts
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
An implementation of a universally verifiable electronic voting scheme based on shuffling
FC'02 Proceedings of the 6th international conference on Financial cryptography
A sender verifiable mix-net and a new proof of a shuffle
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Verifiable Rotation of Homomorphic Encryptions
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Correction, Optimisation and Secure and Efficient Application of PBD Shuffling
Information Security and Cryptology
Minimum Disclosure Counting for the Alternative Vote
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
Formal and precise analysis of soundness of several shuffling schemes
ProvSec'10 Proceedings of the 4th international conference on Provable security
Public-key encrypted bloom filters with applications to supply chain integrity
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Text search protocols with simulation based security
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Efficient zero-knowledge arguments from two-tiered homomorphic commitments
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Efficient zero-knowledge argument for correctness of a shuffle
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
A more efficient computationally sound non-interactive zero-knowledge shuffle argument
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
A secure mix network with an efficient validity verification mechanism
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
International Journal of Security and Networks
Reliable medical recommendation systems with patient privacy
ACM Transactions on Intelligent Systems and Technology (TIST) - Survey papers, special sections on the semantic adaptive social web, intelligent systems for health informatics, regular papers
A more efficient computationally sound non-interactive zero-knowledge shuffle argument
Journal of Computer Security - Advances in Security for Communication Networks
| Hi-index | 0.00 |
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, which in turn are used in protocols for anonymization and voting. Since the plaintexts are encrypted it is not directly verifiable whether a shuffle is correct, and it is often necessary to prove the correctness of a shuffle using a zero-knowledge proof or argument. In previous zero-knowledge shuffle arguments from the literature the communication complexity grows linearly with the number of ciphertexts in the shuffle. We suggest the first practical shuffle argument with sub-linear communication complexity. Our result stems from combining previous work on shuffle arguments with ideas taken from probabilistically checkable proofs.