127 search results - page 22 / 26 » On Cryptographic Schemes Based on Discrete Logarithms and Fa... |
EUROCRYPT
2008
Springer
14 years 11 months ago
2008
Springer
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
101
click to vote
ESA
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We study an online version of Fisher's linear case market. In this market there are m buyers and a set of n dividable goods to be allocated to the buyers. The utilit...
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
ASIACRYPT
2001
Springer
15 years 1 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
ASIACRYPT
2006
Springer
15 years 1 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...