Sciweavers

1770 search results - page 100 / 354
» Writing requirements in computer security
Sort
View
IPTPS
2004
Springer
14 years 2 months ago
Secure Acknowledgment of Multicast Messages in Open Peer-to-Peer Networks
We propose a new cryptographic technique, Acknowledgment Compression, permitting senders of multicast data to verify that all interested parties have either received the data or l...
Antonio Nicolosi, David Mazières
CSFW
2005
IEEE
14 years 2 months ago
Language-Based Information Erasure
Real computing systems sometimes need to forget sensitive information. This paper explores the specification and semantics of information erasure policies, which impose a strong,...
Stephen Chong, Andrew C. Myers
CCS
2005
ACM
14 years 2 months ago
Untraceable RFID tags via insubvertible encryption
We introduce a new cryptographic primitive, called insubvertible encryption, that produces ciphertexts which can be randomized without the need of any key material. Unlike plain u...
Giuseppe Ateniese, Jan Camenisch, Breno de Medeiro...
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 1 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
ICCD
2008
IEEE
142views Hardware» more  ICCD 2008»
14 years 6 months ago
Making register file resistant to power analysis attacks
— Power analysis attacks are a type of side-channel attacks that exploits the power consumption of computing devices to retrieve secret information. They are very effective in br...
Shuo Wang, Fan Zhang, Jianwei Dai, Lei Wang, Zhiji...