Jonathan Katz, Steven Myers, Rafail Ostrovsky  Home/Search
Context Related
| umd.edu/~jkatz/papers/voting.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umd.edu/~jkatz/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value privately and robustly. (Update)
Context of citations to this paper: More
.... restricted to RSA and discrete log based schemes and e#ciency improvements thereof) In particular, as pointed out elsewhere [26, 18, 11, 34, 10], homomorphic, semantically secure, threshold cryptosystems are useful for achieving such goals as (robust) voting and e#cient...
...encryption is used as building block, the distributed key generation and the threshold decryption scheme is not trivial . Both of [7, 6] are e#cient and practical enough to ordinary election in which the exact tally is necessary. However, these can not cover the case...
Cited by: More
Event Driven Private Counters - Eu-Jin Goh Philippe (Correct)
Oblivious Counter and Majority Protocol - Kikuchi (2002) (Correct)
Threshold Cryptosystems Based on Factoring - Katz, Yung (2001) (Correct)
Similar documents (at the sentence level):
62.1%: Cryptographic Counters and Applications to Electronic Voting - Katz, Myers, Ostrovsky (2001) (Correct)
Active bibliography (related documents): More All
0.6: CryptoComputing with rationals - Fouque, Stern, Wackers (2002) (Correct)
0.3: Electronic Jury Voting Protocols - Hevia, Kiwi (2001) (Correct)
0.2: Compensating for a Lack of Transparency - Schoenmakers (2000) (Correct)
Similar documents based on text: More All
0.4: Efficient and Non-Interactive Non-Malleable Commitment - Di Crescenzo, Katz.. (2001) (Correct)
0.4: Efficient Password-Authenticated Key Exchange Using.. - Katz, Ostrovsky, Yung (2001) (Correct)
0.3: Forward Secrecy in Password-Only Key Exchange Protocols - Katz, Ostrovsky, Yung (2002) (Correct)
Related documents from co-citation: More All
2: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes - Paillier - 1999
2: Sharing Decryption in the Context of Voting or Lotteries - Fouque, Poupard et al. - 2000
2: A threshold Cryptosystem without a Trusted Party (context) - Pedersen - 1992
BibTeX entry: (Update)
J. Katz, S. Myers, and R. Ostrovsky. Cryptographic Counters and Applications to Electronic Voting. Eurocrypt 2001. http://citeseer.ist.psu.edu/katz01cryptographic.html More
@article{ katz01cryptographic,
author = "Jonathan Katz and Steven Myers and Rafail Ostrovsky",
title = "Cryptographic Counters and Applications to Electronic Voting",
journal = "Lecture Notes in Computer Science",
volume = "2045",
pages = "78--??",
year = "2001",
url = "citeseer.ist.psu.edu/katz01cryptographic.html" }
Citations (may not include all citations):659 Random Oracles are Practical: A Paradigm for Designing Ecien.. - Bellare, Rogaway - 1993
601 A Public-Key Cryptosystem and a Signature Scheme Based on Di.. (context) - ElGamal - 1985
411 How to Prove Yourself: Practical Solution to Identi cation a.. - Fiat, Shamir - 1986
278 Probabilistic Encryption (context) - Goldwasser, Micali - 1984
250 How to Play Any Mental Game (context) - Goldreich, Micali et al.
154 Secure Multi-Party Computation - Goldreich - 1998
145 Introduction to Finite Fields and their Applications (context) - Lidl, Niederreiter - 1994
77 Non-Interactive Zero-Knowledge and its Applications (context) - Blum, Feldman et al. - 1988
63 Receipt-Free Secret-Ballot Elections (context) - Benaloh, Tuinstra - 1994
54 Multi-Authority SecretBallot Elections with Linear Work - Cramer, Franklin et al. - 1996
42 A Secure and Optimally Ecient Multi-Authority Election Schem.. - Cramer, Gennaro et al. - 1997
41 On Monotone Formula Closure of SZK - De Santis, Di Crescenzo et al. - 1994
40 Distributing the Power of a Government to Enhance the Privac.. (context) - Benaloh, Yung - 1986
28 Fast Evaluation of Logarithms in Fields of Characteristic Tw.. (context) - Coppersmith - 1984
12 A Robust and Veri able Cryptographically Secure Election Sch.. (context) - Cohen, Fischer - 1985
10 A Simple Publicly Veri able Secret Sharing Scheme and its Ap.. (context) - Schoenmakers - 1999
9 Veri able Secret-Ballot Elections (context) - Benaloh - 1987
9 Ecient Receipt-Free Voting Based on Homomorphic Encryption (context) - Hirt, Sako - 2000
8 Applied Abstract Algebra (context) - Lidl, Pilz - 1997
6 Public-Key Cryptosystems Based on Composite Degree Residue C.. (context) - Pallier - 1999
4 Improving the Time Complexity of the Computation of Irreduci.. (context) - Rifa, Borrell - 1991
2 Threshold Cryptosystems with Distributed Prime Factors (context) - Katz, Yung
2 Ecient Protocols Based on Probabilistic Encryption Using Com.. (context) - Damg, Jurik - 2000
Documents on the same site (http://www.cs.umd.edu/~jkatz/papers.html): More
A Game-Theoretic Framework for Analyzing Trust-Inference .. - Morselli, Katz.. (Correct)
Chosen-Ciphertext Security from Identity-Based Encryption - Canetti, Halevi, Katz (2004) (Correct)
Efficient and Non-Malleable Proofs of Plaintext Knowledge and.. - Katz (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC