1612 search results - page 105 / 323 » About models of security protocols |
145
click to vote
CRYPTO
2001
Springer
15 years 8 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
108
click to vote
ASIACRYPT
2000
Springer
15 years 8 months ago
2000
Springer
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
136
click to vote
ACSW
2007
15 years 5 months ago
2007
In ACISP 2006, Peng et al proposed a novel range test technique, which tests whether the integer encrypted in a ciphertext is in an interval range. Their solution is more efficien...
135
click to vote
NORDSEC
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we report the results of the formal analysis performed on the Estonian Mobile-ID protocol (deployed since 2008), allowing citizens and permanent residents of Estonia...
142
click to vote
CRYPTO
2004
Springer
15 years 9 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...