Sciweavers

21 search results - page 1 / 5
» Evaluating Security of Voting Schemes in the Universal Compo...
Sort
View
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
13 years 7 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
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...
Jens Groth
INDOCRYPT
2005
Springer
13 years 9 months ago
A Universally Composable Scheme for Electronic Cash
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-...
Mårten Trolin
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
13 years 7 months ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
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...
Tal Moran, Moni Naor
CISIM
2007
IEEE
13 years 10 months ago
Universally Composable Key-Evolving Signature
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...
Jin Zhou, Yuefei Zhu, TingMao Chang, YaJuan Zhang
CRYPTO
2004
Springer
162views Cryptology» more  CRYPTO 2004»
13 years 9 months ago
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
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...
Masayuki Abe, Serge Fehr