A Secure and Optimally Efficient Multi-Authority Election Scheme

Ronald Cramer; Rosario Gennaro; Berry Schoenmakers

doi:10.1007/3-540-69053-0_9

Keywords

Computer scienceScheme (mathematics)BallotVotingRobustness (evolution)EncryptionComputer securityComputational complexity theoryCommunication complexityTheoretical computer scienceAlgorithmMathematicsLawPolitical science

Affiliated Institutions

Related Publications

A secure and optimally efficient multi‐authority election scheme

Ronald Cramer , Rosario Gennaro , Berry Schoenmakers

Abstract In this paper we present a new multi‐authority secret‐ballot election scheme that guarantees privacy, universal veriability, and robustness. It is the first scheme for ...

1997 European Transactions on Telecommunic... 786 citations

Verifiable secret-ballot elections

Josh Benaloh

Privacy in secret-ballot elections has traditionally been attained by using a ballot box or voting booth to disassociate voters from ballots. Although such a system might achiev...

1987 385 citations

A New Approach for Algebraically Homomorphic Encryption.

Frederik Armknecht , Ahmad‐Reza Sadeghi

The existence of an efficient and provably secure algebraically homomorphic scheme (AHS), i.e., one that supports both addition and multiplication operations, is a long stated o...

2008 MADOC (University of Mannheim) 29 citations

A Survey on Homomorphic Encryption Schemes

Abbas Acar , Hidayet Aksu , A. Selcuk Uluagac +1 more

Legacy encryption systems depend on sharing a key (public or private) among the peers involved in exchanging an encrypted message. However, this approach poses privacy concerns....

2018 ACM Computing Surveys 1104 citations

An ID-based cryptosystem based on the discrete logarithm problem

Shigeo Tsujii , Toshiya Itoh

In a modern network system, data security technologies such as cryptosystems, signature schemes, etc., are indispensable for reliable data transmission. In particular, for a lar...

1989 IEEE Journal on Selected Areas in Com... 190 citations

Publication Info

Year: 1997
Type: book-chapter
Pages: 103-118
Citations: 345
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

A Secure and Optimally Efficient Multi-Authority Election Scheme

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

345

OpenAlex

Cite This

APA Style

                            
                                    Ronald Cramer, 
                                
                                    Rosario Gennaro, 
                                
                                    Berry Schoenmakers
                                
                            (1997). 
                            A Secure and Optimally Efficient Multi-Authority Election Scheme. 
                            Lecture notes in computer science
                            
                            , 103-118.
                            https://doi.org/10.1007/3-540-69053-0_9

Identifiers

DOI: 10.1007/3-540-69053-0_9