The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
An Efficient Scheme for Proving a Shuffle
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Mix-Networks on Permutation Networks
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Remarks on Mix-Network Based on Permutation Networks
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
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
Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks
CRYPTO '91 Proceedings of the 11th 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
The Mathematical Theory of Nonblocking Switching Networks (Series on Applied Mathematics)
The Mathematical Theory of Nonblocking Switching Networks (Series on Applied Mathematics)
Efficient Protocols for Set Membership and Range Proofs
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Universally Composable Adaptive Priced Oblivious Transfer
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Linear Algebra with Sub-linear Zero-Knowledge Arguments
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
A secure and optimally efficient multi-authority election scheme
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Perfect NIZK with adaptive soundness
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Secure Vickrey auctions without threshold trust
FC'02 Proceedings of the 6th international conference on Financial cryptography
Cryptographic primitives enforcing communication and storage complexity
FC'02 Proceedings of the 6th international conference on Financial cryptography
A non-interactive shuffle with pairing based verifiability
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Sub-linear zero-knowledge argument for correctness of a shuffle
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Efficient non-interactive proof systems for bilinear groups
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Efficiency-improved fully simulatable adaptive OT under the DDH assumption
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Additive combinatorics and discrete logarithm based range protocols
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
A family of implementation-friendly BN elliptic curves
Journal of Systems and Software
Generic fully simulatable adaptive oblivious transfer
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Gradual sub-lattice reduction and a new complexity for factoring polynomials
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Pairing-Friendly elliptic curves of prime order
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
New Techniques for Noninteractive Zero-Knowledge
Journal of the ACM (JACM)
Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
On round-optimal zero knowledge in the bare public-key model
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
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
IEEE Transactions on Information Theory
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
| Hi-index | 0.00 |
We propose a new non-interactive perfect zero-knowledge NIZK shuffle argument that, when compared with the only previously known efficient NIZK shuffle argument by Groth and Lu, has a small constant factor times smaller computation and communication, and is based on more standard computational assumptions. Differently from Groth and Lu who only prove the co-soundness of their argument under purely computational assumptions, we prove computational soundness under a necessary knowledge assumption. We also present a general transformation that results in a shuffle argument that has a quadratically smaller common reference string CRS and a small constant factor times longer argument than the original shuffle. This can be interpreted as a general technique of decreasing the offline cost of an arbitrary shuffle argument.