44 search results - page 6 / 9 » eurocrypt 2008 |
107
click to vote
EUROCRYPT
2008
Springer
15 years 1 months ago
2008
Springer
Consider an abstract storage device (G) that can hold a single element x from a fixed, publicly known finite group G. Storage is private in the sense that an adversary does not hav...
EUROCRYPT
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The problem we study in this paper is the key recovery problem on the C schemes and generalizations where the quadratic monomial of C (the product of two linear monomials...
EUROCRYPT
2008
Springer
15 years 1 months ago
2008
Springer
Precise zero knowledge introduced by Micali and Pass (STOC'06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed t...
111
click to vote
IACR
2011
13 years 11 months ago
2011
Aggregation schemes allow to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion o...
CTRSA
2008
Springer
15 years 1 months ago
2008
Springer
In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits...