570 search results - page 69 / 114 » Black-box constructions for secure computation |
TCC
2010
Springer
14 years 4 months ago
2010
Springer
We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one t...
MMSEC
2006
ACM
14 years 1 months ago
2006
ACM
Two different approaches for constructing a steganographic channel in an IEEE 802.11 (WLAN) network are introduced in this paper. First test results on the reliability, undetectab...
TCC
2010
Springer
14 years 4 months ago
2010
Springer
The strongest standard security notion for digital signature schemes is unforgeability under chosen message attacks. In practice, however, this notion can be insuļ¬cient due to ā...
CCS
2008
ACM
13 years 10 months ago
2008
ACM
This paper reconsiders the threat posed by Shacham's "return-oriented programming" -- a technique by which WX-style hardware protections are evaded via carefully cr...
SOUPS
2009
ACM
14 years 2 months ago
2009
ACM
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suļ¬er from numerous pro...