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
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
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Proceedings of the 11th USENIX Security Symposium
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
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 anonymity-preserving data collection
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Data collection with self-enforcing privacy
Proceedings of the 13th ACM conference on Computer and communications security
Batch zero-knowledge proof and verification and its applications
ACM Transactions on Information and System Security (TISSEC)
EVT'06 Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop
Ballot casting assurance via voter-initiated poll station auditing
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
Homomorphic encryption and secure comparison
International Journal of Applied Cryptography
Distributed Verification of Mixing - Local Forking Proofs Model
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
An Indistinguishability-Based Characterization of Anonymous Channels
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Privacy Preserving Data Mining within Anonymous Credential Systems
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Data Collection with Self-Enforcing Privacy
ACM Transactions on Information and System Security (TISSEC)
Towards Robust Computation on Encrypted Data
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Administrative and public verifiability: can we have both?
EVT'08 Proceedings of the conference on Electronic voting technology
Analysis, improvement and simplification of Prêt à voter with Paillier encryption
EVT'08 Proceedings of the conference on Electronic voting technology
Batch Processing for Proofs of Partial Knowledge and Its Applications
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Verifiable Rotation of Homomorphic Encryptions
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Efficient Vote Validity Check in Homomorphic Electronic Voting
Information Security and Cryptology --- ICISC 2008
Proving a Shuffle Using Representations of the Symmetric Group
Information Security and Cryptology --- ICISC 2008
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Correction, Optimisation and Secure and Efficient Application of PBD Shuffling
Information Security and Cryptology
A Commitment-Consistent Proof of a Shuffle
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Minimum Disclosure Counting for the Alternative Vote
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
A verifiable, centralized, coercion-free reputation system
Proceedings of the 8th ACM workshop on Privacy in the electronic society
Split-ballot voting: Everlasting privacy with distributed trust
ACM Transactions on Information and System Security (TISSEC)
Deterring voluntary trace disclosure in re-encryption mix-networks
ACM Transactions on Information and System Security (TISSEC)
Shuffle-sum: coercion-resistant verifiable tallying for STV voting
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Simple and efficient hash-based verifiable mixing for remote electronic voting
Computer Communications
Efficient bid validity check in ElGamal-based sealed-bid e-auction
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Practical and secure solutions for integer comparison
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Verifiable shuffle of large size ciphertexts
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Efficient and secure comparison for on-line auctions
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
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
An efficient aggregate shuffle argument scheme
FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable 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
Algorithms and theory of computation handbook
Pretty good democracy for more expressive voting schemes
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Formal and precise analysis of soundness of several shuffling schemes
ProvSec'10 Proceedings of the 4th international conference on Provable security
Revocation for delegatable anonymous credentials
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
An efficient shuffling based eVoting scheme
Journal of Systems and Software
Efficient and secure generalized pattern matching via fast fourier transform
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Filtering for private collaborative benchmarking
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
An adaptively secure mix-net without erasures
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
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
A novel method to maintain privacy in mobile agent applications
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Non-interactive zero-knowledge arguments for voting
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Simple and efficient shuffling with provable correctness and ZK privacy
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
An efficient and verifiable solution to the millionaire problem
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
An efficient publicly verifiable mix-net for long inputs
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
On some incompatible properties of voting schemes
Towards Trustworthy Elections
Klein bottle routing: an alternative to onion routing and mix network
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Mix-Network with stronger security
PET'05 Proceedings of the 5th international conference on Privacy Enhancing Technologies
Efficient cryptographic protocol design based on distributed el gamal encryption
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Malleable proof systems and applications
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Ballot aggregation and mixnet based open-audit elections
EuroPKI'11 Proceedings of the 8th European conference on Public Key Infrastructures, Services, and Applications
Cryptanalysis of a universally verifiable efficient re-encryption mixnet
EVT/WOTE'12 Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections
The norwegian internet voting protocol
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Scaling privacy guarantees in code-verification elections
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
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 |
We show how to prove in honest verifier zero-knowledge the correctness of a shuffle of homomorphic encryptions (or homomorphic commitments.) A shuffle consists in a rearrangement of the input cipher-texts and a reencryption of them so that the permutation is not revealed. Our scheme is more efficient than previous schemes both in terms of communication complexity and computational complexity. Indeed, in the case of shuffling ElGamal encryptions, the proof of correctness is smaller than the encryptions themselves.