Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
34
views
25
references
Top references
cited by
20
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,103
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Public Key Cryptography
Self-tallying Elections and Perfect Ballot Secrecy
other
Author(s):
Aggelos Kiayias
,
Moti Yung
Publication date
(Online):
February 5 2002
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Journal of Self-Assembly and Molecular Electronics
Most cited references
25
Record
: found
Abstract
: not found
Book Chapter
: not found
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Pascal Paillier
(1999)
0
comments
Cited
364
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Untraceable electronic mail, return addresses, and digital pseudonyms
David Chaum
(1981)
0
comments
Cited
283
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A Generalisation, a Simpli.cation and Some Applications of Paillier's Probabilistic Public-Key System
Ivan Damgård
,
Mads Jurik
(2001)
0
comments
Cited
89
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2002
Publication date (Online):
February 5 2002
Pages
: 141-158
DOI:
10.1007/3-540-45664-3_10
SO-VID:
7a613275-a407-425f-9c84-29e410003a95
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 125
Client/Server Tradeoffs for Online Elections
pp. 48
Multi-recipient Public-Key Encryption with Shortened Ciphertext
pp. 115
M + 1-st Price Auction Using Homomorphic Encryption
pp. 141
Self-tallying Elections and Perfect Ballot Secrecy
pp. 159
Efficient 1-Out-n Oblivious Transfer Schemes
pp. 280
A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks
Similar content
3,103
A diagnostically promising technique for tallying nominal reference errors in the narratives of school-aged children with foetal alcohol spectrum disorders (FASD).
Authors:
John C Thorne
,
Truman Coggins
A hybrid approach to vector-based homomorphic tallying remote voting
Authors:
Víctor Mateu
,
Josep M. Miret
,
Francesc Sebé
The nuclear testing tally
Authors:
See all similar
Cited by
20
A Length-Flexible Threshold Cryptosystem with Applications
Authors:
Ivan Damgård
,
Mads Jurik
Coercion-Resistant Electronic Elections
Authors:
Ari Juels
,
Dario Catalano
,
Markus Jakobsson
Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast
Authors:
Jens Groth
See all cited by