91 search results - page 13 / 19 » Bounded Key-Dependent Message Security |
CODCRY
2009
Springer
15 years 4 months ago
2009
Springer
We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second on...
92
Voted
ASIAN
2006
Springer
15 years 1 months ago
2006
Springer
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...
76
Voted
ACSAC
2010
IEEE
14 years 7 months ago
2010
IEEE
Leakage of confidential information represents a serious security risk. Despite a number of novel, theoretical advances, it has been unclear if and how quantitative approaches to ...
74
Voted
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...