Distributing the power of a government to enhance the privacy of voters
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Discrete logarithms in finite fields and their cryptographic significance
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A course in number theory and cryptography
A course in number theory and cryptography
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Secret sharing homomorphisms: keeping shares of a secret secret
Proceedings on Advances in cryptology---CRYPTO '86
Zero-knowledge undeniable signatures (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Efficient anonymous channel and all/nothing election scheme
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Achieving independence efficiently and securely
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th 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
Secure Voting Using Partially Compatible Homomorphisms
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A Practical Secret Voting Scheme for Large Scale Elections
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: 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
On monotone formula closure of SZK
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Multi-authority secret-ballot elections with linear work
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
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
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
Almost entirely correct mixing with applications to voting
Proceedings of the 9th ACM conference on Computer and communications security
Electronic Jury Voting Protocols
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Optimistic Mixing for Exit-Polls
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Proceedings of the 11th USENIX Security Symposium
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
Mixminion: Design of a Type III Anonymous Remailer Protocol
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Reusable anonymous return channels
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Electronic jury voting protocols
Theoretical Computer Science - Latin American theorotical informatics
Minx: a simple and efficient anonymous packet format
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Proceedings of the 11th ACM conference on Computer and communications security
Proceedings of the 11th ACM conference on Computer and communications security
Coercion-resistant electronic elections
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Scratch & vote: self-contained paper-based cryptographic voting
Proceedings of the 5th ACM workshop on Privacy in electronic society
Private social network analysis: how to assemble pieces of a graph privately
Proceedings of the 5th ACM workshop on Privacy in electronic society
System and network trustworthiness in perspective
Proceedings of the 13th ACM conference on Computer and communications security
Data collection with self-enforcing privacy
Proceedings of the 13th ACM conference on Computer and communications security
Data Mining and Knowledge Discovery
Anonymous communications in the Internet
Cluster Computing
EVT'06 Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop
EVT'06 Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop
Cryptographic voting protocols: a systems perspective
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
Single-bit re-encryption with applications to distributed proof systems
Proceedings of the 2007 ACM workshop on Privacy in electronic society
Denial of service or denial of security?
Proceedings of the 14th ACM conference on Computer and communications security
High-performance public-key cryptoprocessor for wireless mobile applications
Mobile Networks and Applications
Casting votes in the auditorium
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
Ballot casting assurance via voter-initiated poll station auditing
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
A collection of privacy design patterns
Proceedings of the 2006 conference on Pattern languages of programs
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
An Indistinguishability-Based Characterization of Anonymous Channels
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
How to Bypass Two Anonymity Revocation Schemes
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Collusion-Free Protocols in the Mediated Model
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Privacy Preserving Data Mining within Anonymous Credential Systems
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Simplified Submission of Inputs to Protocols
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Human Readable Paper Verification of Prêt à Voter
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Data Collection with Self-Enforcing Privacy
ACM Transactions on Information and System Security (TISSEC)
A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Secure Internet Voting Based on Paper Ballots
ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Helios: web-based open-audit voting
SS'08 Proceedings of the 17th conference on Security symposium
VoteBox: a tamper-evident, verifiable electronic voting system
SS'08 Proceedings of the 17th conference on Security symposium
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
A secure and anonymous voter-controlled election scheme
Journal of Network and Computer Applications
Secure Multiparty Computation for Comparator Networks
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
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
A Design of Secure Preferential E-Voting
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
Identity-based mix: Anonymous communications without public key certificates
Computers and Electrical Engineering
On voting machine design for verification and testability
Proceedings of the 16th ACM conference on Computer and communications security
Deterring voluntary trace disclosure in re-encryption mix-networks
ACM Transactions on Information and System Security (TISSEC)
Survey on anonymous communications in computer networks
Computer Communications
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Prêt à voter: a voter-verifiable voting system
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Shuffle-sum: coercion-resistant verifiable tallying for STV voting
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Flaws in some robust optimistic mix-nets
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
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
An implementation of a universally verifiable electronic voting scheme based on shuffling
FC'02 Proceedings of the 6th international conference on Financial cryptography
Reliable MIX cascade networks through reputation
FC'02 Proceedings of the 6th international conference on Financial cryptography
Verifiable internet voting solving secure platform problem
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
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
Threat analysis of a practical voting scheme with receipts
VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
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
Towards trustworthy e-voting using paper receipts
Computer Standards & Interfaces
Efficient receipt-free ballot casting resistant to covert channels
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
Ballot permutations in prêt à voter
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
Dissent: accountable anonymous group messaging
Proceedings of the 17th ACM conference on Computer and communications security
Structure-preserving signatures and commitments to group elements
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Algorithms and theory of computation handbook
Efficiency-improved fully simulatable adaptive OT under the DDH assumption
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Pretty good democracy for more expressive voting schemes
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
T-DRE: a hardware trusted computing base for direct recording electronic vote machines
Proceedings of the 26th Annual Computer Security Applications Conference
Performance requirements for end-to-end verifiable elections
EVT/WOTE'10 Proceedings of the 2010 international conference on Electronic voting technology/workshop on trustworthy elections
Parallel shuffling and its application to prêt à voter
EVT/WOTE'10 Proceedings of the 2010 international conference on Electronic voting technology/workshop on trustworthy elections
Formal and precise analysis of soundness of several shuffling schemes
ProvSec'10 Proceedings of the 4th international conference on Provable security
A model for system-based analysis of voting systems
Proceedings of the 15th international conference on Security protocols
Relations among privacy notions
ACM Transactions on Information and System Security (TISSEC)
An efficient shuffling based eVoting scheme
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
Secure internet voting on limited devices with anonymized DSA public keys
EVT/WOTE'11 Proceedings of the 2011 conference on Electronic voting technology/workshop on trustworthy elections
Prêt à voter with confirmation codes
EVT/WOTE'11 Proceedings of the 2011 conference on Electronic voting technology/workshop on trustworthy elections
Verifiable encrypted redundancy for mix-type remote electronic voting
EGOVIS'11 Proceedings of the Second international conference on Electronic government and the information systems perspective
Practical remote end-to-end voting scheme
EGOVIS'11 Proceedings of the Second international conference on Electronic government and the information systems perspective
Minimising anonymity loss in anonymity networks under DoS attacks
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Breaking four mix-related schemes based on universal re-encryption
ISC'06 Proceedings of the 9th international conference on Information 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
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
On the PET workshop panel “mix cascades versus peer-to-peer: is one concept superior?”
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
Some remarks on universal re-encryption and a novel practical anonymous tunnel
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Simple and efficient shuffling with provable correctness and ZK privacy
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
A practical voter-verifiable election scheme
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
A practical voting scheme with receipts
ISC'05 Proceedings of the 8th international conference on Information Security
Prêt à voter with re-encryption mixes
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
A private stable matching algorithm
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
An efficient publicly verifiable mix-net for long inputs
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Auditable privacy: on tamper-evident mix networks
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
Towards Trustworthy Elections
Coercion-resistant electronic elections
Towards Trustworthy Elections
An implementation of a mix-net based network voting scheme and its use in a private organization
Towards Trustworthy Elections
The vector-ballot approach for online voting procedures
Towards Trustworthy Elections
On some incompatible properties of voting schemes
Towards Trustworthy Elections
A threat analysis of prêt à voter
Towards Trustworthy Elections
A verifiable voting protocol based on farnel
Towards Trustworthy Elections
A practical and secure coercion-resistant scheme for internet voting
Towards Trustworthy Elections
k-times anonymous authentication with a constant proving cost
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Klein bottle routing: an alternative to onion routing and mix network
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Improved efficiency for private stable matching
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
An analysis of parallel mixing with attacker-controlled inputs
PET'05 Proceedings of the 5th international conference on Privacy Enhancing Technologies
Prêt à Voter with Paillier encryption
Mathematical and Computer Modelling: An International Journal
A game-theoretic analysis of cooperation in anonymity networks
POST'12 Proceedings of the First international conference on Principles of Security and Trust
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
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
Efficiently shuffling in public
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Coercion-resistant electronic elections with write-in candidates
EVT/WOTE'12 Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections
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
DJoin: differentially private join queries over distributed databases
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Dissent in numbers: making strong anonymity scale
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
The norwegian internet voting protocol
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
Feasibility analysis of Prêt à voter for german federal elections
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
Trivitas: voters directly verifying votes
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
Practical Internet voting system
Journal of Network and Computer Applications
A secure mix network with an efficient validity verification mechanism
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
A mix-net from any CCA2 secure cryptosystem
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Boardroom voting scheme with unconditionally secret ballots based on DC-Net
NSS'12 Proceedings of the 6th international conference on Network and System Security
Privacy-preserving disjunctive normal form operations on distributed sets
Information Sciences: an International Journal
Randomized partial checking revisited
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
International Journal of Security and Networks
Private over-threshold aggregation protocols
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Towards efficient traffic-analysis resistant anonymity networks
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Hang with your buddies to resist intersection attacks
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Conscript your friends into larger anonymity sets with JavaScript
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Scaling privacy guarantees in code-verification elections
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
Proactively accountable anonymous messaging in verdict
SEC'13 Proceedings of the 22nd USENIX conference on Security
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 present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universally verifiable, multi-authority election schemes. The output of the shuffle operation is another sequence of k modular integers, each of which is the same secret power of a corresponding input element, but the order of elements in the output is kept secret. Though it is a trivial matter for the "shuffler" (who chooses the permutation of the elements to be applied) to compute the output from the input, the construction is important because it provides a linear size proof of correctness for the output sequence (i.e. a proof that it is of the form claimed) that can be checked by an arbitrary verifiers. The complexity of the protocol improves on that of Furukawa-Sako[16] both measured by number of exponentiations and by overall size.The protocol is shown to be honest-verifier zeroknowledge in a special case, and is computational zeroknowledge in general. On the way to the final result, we also construct a generalization of the well known Chaum-Pedersen protocol for knowledge of discrete logarithm equality [10], [7]. In fact, the generalization specializes exactly to the Chaum-Pedersen protocol in the case k = 2. This result may be of interest on its own.An application to electronic voting is given that matches the features of the best current protocols with significant efficiency improvements. An alternative application to electronic voting is also given that introduces an entirely new paradigm for achieving Universally Verifiable elections.