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
29
views
17
references
Top references
cited by
26
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,608
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology — EUROCRYPT 2000
Efficient Receipt-Free Voting Based on Homomorphic Encryption
other
Author(s):
Martin Hirt
,
Kazue Sako
Publication date
(Online):
May 12 2000
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
Value-based Healthcare
Most cited references
17
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
Conference Proceedings
: not found
A practical scheme for non-interactive verifiable secret sharing
Paul Feldman
(1987)
0
comments
Cited
78
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A Threshold Cryptosystem without a Trusted Party
Torben Pryds Pedersen
(1991)
0
comments
Cited
63
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2000
Publication date (Online):
May 12 2000
Pages
: 539-556
DOI:
10.1007/3-540-45539-6_38
SO-VID:
5f3b1ccd-8a1c-49dd-a4a2-9ba19c6f3fb2
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 19
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
pp. 53
Noisy Polynomial Interpolation and Noisy Chinese Remaindering
pp. 104
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
pp. 122
Single Database Private Information Retrieval Implies Oblivious Transfer
pp. 156
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
pp. 221
Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures
pp. 259
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
pp. 275
Using Hash Functions as a Hedge against Chosen Ciphertext Attack
pp. 408
Cryptanalysis of Patarin’s 2-Round Public Key System with S Boxes (2R)
pp. 418
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
pp. 431
Efficient Proofs that a Committed Number Lies in an Interval
pp. 445
A Composition Theorem for Universal One-Way Hash Functions
pp. 453
Exposure-Resilient Functions and All-or-Nothing Transforms
pp. 470
The Sum of PRPs Is a Secure PRF
pp. 485
Construction of Nonlinear Boolean Functions with Important Cryptographic Properties
pp. 539
Efficient Receipt-Free Voting Based on Homomorphic Encryption
pp. 557
How to Break a Practical MIX and Design a New One
pp. 573
Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
pp. 589
Advanced Slide Attacks
Similar content
4,608
Minimax Approximation of Sign Function by Composite Polynomial for Homomorphic Comparison
Authors:
Eunsang Lee
,
Joon-Woo Lee
,
Jong-Seon No
…
Privacy-preserving neural networks with Homomorphic encryption: Challenges and opportunities, Peer-to-Peer Netw.
Authors:
B Pulido-Gaytan
,
A. Tchernykh
,
JM Cortés-Mendoza
…
TenSEAL: A Library for Encrypted Tensor Operations Using Homomorphic Encryption.
Authors:
A Benaïssa
,
B Retiat
,
B Cebere
…
See all similar
Cited by
26
Self-tallying Elections and Perfect Ballot Secrecy
Authors:
Aggelos Kiayias
,
Moti Yung
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
Authors:
Tal Moran
,
Moni Naor
A generalization of Paillier’s public-key system with applications to electronic voting
Authors:
Ivan Damgård
,
Mads Jurik
,
Jesper Nielsen
See all cited by