Amanote Research

Amanote Research

  • Register
  • Sign In

Elections With Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA

Lecture Notes in Computer Science- Germany

doi 10.1007/3-540-45961-8_15

Full Text

Abstract

Available in

Categories

Computer ScienceTheoretical Computer Science

Date

January 1, 1988

Authors

David Chaum

Publisher

Springer Berlin Heidelberg


Related search

Secret Ballots: A Cure for Apathy?

BMJ
1991English

On the Design of RSA With Short Secret Exponent

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Combination of Facial Biometrics and RSA Algorithms to Secure the Secret Message

2019English

Geometric Realization of Electronic Elections Based on Threshold Secret Sharing

Vestnik of Don State Technical University
2018English

Analytical Comparison of RSA and RSA With Chinese Remainder Theorem

Journal of Independent Studies and Research - Computing
2016English

A Forward-Secure Threshold Signature Scheme Based on Multiplicative Secret Sharing and Strong RSA Assumption

DEStech Transactions on Computer Science and Engineering
2018English

The European Union: From Elections to Elections

Sovremennaya Evropa
EconomicsInternational RelationsEconometricsPolitical Science
2016English

Nanoscale Radiofrequency Impedance Sensors With Unconditionally Stable Tuning

Journal of Applied Physics
AstronomyPhysics
2009English

Elections to Membership

Bulletin of the American Mathematical Society
1975English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy