135
Voted
CRYPTO
15 years 2 months ago
2008 Springer 
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
110
Voted
CRYPTO
15 years 2 months ago
2008 Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
102
Voted
CRYPTO
15 years 2 months ago
2008 Springer
In this article, we analyze the security of the GOST hash function. The GOST hash function, defined in the Russian standard GOST 34.11-94, is an iterated hash function producing a ...
110
click to vote
CRYPTO
15 years 2 months ago
2008 Springer
Abstract. The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest possible" notion of security for...
108
click to vote
CRYPTO
15 years 2 months ago
2008 Springer 
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
|
Cryptology