Location of Repository

Batch Verification for Equality of Discrete Logarithms and Threshold Decryptions

By Riza Aditya, Colin Boyd, Edward Dawson, Byoungcheon Lee and Kun Peng
Publisher: Springer-Verlag
Year: 2004
OAI identifier: oai:eprints.qut.edu.au:23930

Suggested articles

Preview

Citations

  1. (2001). A generalisation, a simplification and some applications of paillier’s probabilistic public-key system.
  2. (1997). A secure and optimally efficient multi-authority election scheme.
  3. (2002). Almost entirely correct mixing with applications to voting.
  4. (2000). An auction protocol which hides bids of losers.
  5. (2000). Attacking and repairing batch verification schemes.
  6. (1993). Chaum and Torben Pryds Pedersen. Wallet databases with observers.
  7. (2000). Efficient protocols based on probabilistic encryption using composite degree residue classes. Cryptology ePrint Archive,
  8. (1998). Fast batch verification for modular exponentiation and digital signatures.
  9. (1979). How to share a secret.
  10. (2000). Identification of bad signatures in batches.
  11. (2002). M+1-st price auction using homomorphic encryption.
  12. (1992). Non-interactive and information-theoretic secure verifiable secret sharing.
  13. (1999). On the fly signatures based on factoring.
  14. (2001). Practical multi-candidate election system.
  15. Practical threshold signatures.
  16. (1999). Public-key cryptosystems based on composite degree residuosity classes.
  17. (1995). Secure signature schemes based on interactive protocols.
  18. (2000). Sharing decryption in the context of voting or lotteries.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.