503 search results - page 27 / 101 » An Independence Relation for Sets of Secrets |
ICS
2010
Tsinghua U.
14 years 5 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
ICALP
2011
Springer
12 years 12 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
CISC
2007
Springer
14 years 2 months ago
2007
Springer
Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, w...
ESORICS
2007
Springer
14 years 2 months ago
2007
Springer
The problem of key management in access hierarchies studies ways to assign keys to users and classes such that each user, after receiving her secret key(s), is able to independentl...
ICNP
2003
IEEE
14 years 1 months ago
2003
IEEE
A prerequisite for secure communication between two nodes in an ad hoc network is that the nodes share a key to bootstrap their trust relationship. In this paper, we present a sca...