773 search results - page 42 / 155 » On Cryptographic Assumptions and Challenges |
102
click to vote
ALT
2000
Springer
15 years 6 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
138
click to vote
CRYPTO
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
142
click to vote
ASIACRYPT
2011
Springer
14 years 1 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
150
click to vote
ASIACRYPT
2011
Springer
14 years 1 months ago
2011
Springer
We present a generic method to secure various widely-used cryptosystems against arbitrary side-channel leakage, as long as the leakage adheres three restrictions: first, it is bou...
136
click to vote
IACR
2011
14 years 1 months ago
2011
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...