Sciweavers

222 search results - page 31 / 45
» How to Forget a Secret
Sort
View
EUROCRYPT
2001
Springer
15 years 2 months ago
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
Yevgeniy Dodis, Amit Sahai, Adam Smith
DATE
2006
IEEE
95views Hardware» more  DATE 2006»
15 years 1 months ago
Satisfiability-based framework for enabling side-channel attacks on cryptographic software
- Many electronic systems contain implementations of cryptographic algorithms in order to provide security. It is well known that cryptographic algorithms, irrespective of their th...
Nachiketh R. Potlapally, Anand Raghunathan, Srivat...
CCR
2006
76views more  CCR 2006»
14 years 10 months ago
Secure distributed data-mining and its application to large-scale network measurements
The rapid growth of the Internet over the last decade has been startling. However, efforts to track its growth have often fallen afoul of bad data -- for instance, how much traffi...
Matthew Roughan, Yin Zhang
IACR
2011
115views more  IACR 2011»
13 years 9 months ago
Multi-Server Oblivious RAM
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
Steve Lu, Rafail Ostrovsky
ICIP
2006
IEEE
15 years 11 months ago
Determining Achievable Rates for Secure, Zero Divergence, Steganography
In steganography (the hiding of data into innocuous covers for secret communication) it is difficult to estimate how much data can be hidden while still remaining undetectable. To...
Kenneth Sullivan, Kaushal Solanki, B. S. Manjunath...