21 search results - page 1 / 5 » Evaluating Security of Voting Schemes in the Universal Compo... |
ACNS
2004
Springer
14 years 2 months ago
2004
Springer
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
INDOCRYPT
2005
Springer
14 years 4 months ago
2005
Springer
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...
CRYPTO
2006
Springer
14 years 2 months ago
2006
Springer
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
CISIM
2007
IEEE
14 years 5 months ago
2007
IEEE
The standard digital signature scheme can be easily subject to key exposure problem In order to overcome this problem; a feasible and effective approach is employed by key-evolving...
CRYPTO
2004
Springer
14 years 4 months ago
2004
Springer
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...