242 search results - page 19 / 49 » Randomness in Cryptography |
147
Voted
PAIRING
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
118
Voted
TCC
2012
Springer
13 years 10 months ago
2012
Springer
The (decisional) learning with errors problem (LWE) asks to distinguish “noisy” inner products of a secret vector with random vectors from uniform. In recent years, the LWE pro...
141
click to vote
PERCOM
2011
ACM
14 years 6 months ago
2011
ACM
—In this work we study the problem of query privacy in large scale sensor networks. Motivated by a novel trust model in which clients query networks owned by trusted entities but...
192
Voted
PKC
2011
Springer
14 years 5 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
95
Voted
DCC
2006
IEEE
16 years 2 months ago
2006
IEEE
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...