Sciweavers

555 search results - page 40 / 111
» From ABZ to Cryptography
Sort
View
TCC
2005
Springer
77views Cryptology» more  TCC 2005»
14 years 3 months ago
Upper and Lower Bounds on Black-Box Steganography
We study the limitations of steganography when the sender is not using any properties of the underlying channel beyond its entropy and the ability to sample from it. On the negati...
Nenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russ...
NSPW
2004
ACM
14 years 3 months ago
Symmetric behavior-based trust: a new paradigm for internet computing
Current models of Internet Computing are highly asymmetric – a host protects itself from malicious mobile Java programs, but there is no way to get assurances about the behavior...
Vivek Haldar, Michael Franz
SRDS
2003
IEEE
14 years 3 months ago
SNARE: A Strong Security Scheme for Network-Attached Storage
This paper presents a strong security scheme for network-attached storage (NAS) that is based on capability and uses a key distribution scheme to keep network-attached storage fro...
Yingwu Zhu, Yiming Hu
ACNS
2003
Springer
129views Cryptology» more  ACNS 2003»
14 years 3 months ago
Using Feedback to Improve Masquerade Detection
Abstract. To gain access to account privileges, an intruder masquerades as the proper account user. Information from user feedback helps to improve the accuracy of classifiers use...
Kwong H. Yung
TCS
2010
13 years 4 months ago
Bounds on the efficiency of black-box commitment schemes
Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theor...
Omer Horvitz, Jonathan Katz