319 search results - page 17 / 64 » Cryptographic Assumptions: A Position Paper |
MOC
2002
14 years 9 months ago
2002
In this paper the densities D(i) of prime numbers p having the least primitive root g(p) = i, where i is equal to one of the initial positive integers less than 32, have been numer...
TCC
2009
Springer
15 years 10 months ago
2009
Springer
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
IACR
2011
13 years 9 months ago
2011
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...
111
click to vote
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
USS
2008
14 years 12 months ago
2008
The inability of humans to generate and remember strong secrets makes it difficult for people to manage cryptographic keys. To address this problem, numerous proposals have been s...