ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
We show that probabilistically checkable proofs can be used to shorten non-interactive zero-knowledge proofs. We obtain publicly verifiable non-interactive zero-knowledge proofs fo...
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In this work, we take a closer look at anonymity and robustness in encryption schemes. Roughly speaking, an anonymous encryption scheme hides the identity of the secret-k...
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
Bit-decomposition, which is proposed by Damg
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
Blinding is a popular and well-known countermeasure to protect public-key cryptosystems against side-channel attacks. The high level idea is to randomize an exponentiation in order...
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
In a recent work, Mangard et al. showed that under certain assumptions, the (so-called) standard univariate side-channel attacks using a distance-of-means test, correlation analysi...