Sciweavers

2363 search results - page 417 / 473
» How Secure is RFID
Sort
View
CHES
2005
Springer
281views Cryptology» more  CHES 2005»
15 years 9 months ago
Data Remanence in Flash Memory Devices
Data remanence is the residual physical representation of data that has been erased or overwritten. In non-volatile programmable devices, such as UV EPROM, EEPROM or Flash, bits ar...
Sergei P. Skorobogatov
CIKM
2005
Springer
15 years 9 months ago
Indexing time vs. query time: trade-offs in dynamic information retrieval systems
We examine issues in the design of fully dynamic information retrieval systems with support for instantaneous document insertions and deletions. We present one such system and dis...
Stefan Büttcher, Charles L. A. Clarke
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
15 years 9 months ago
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
Secret-key agreement between two parties Alice and Bob, connected by an insecure channel, can be realized in an informationtheoretic sense if the parties share many independent pai...
Thomas Holenstein, Renato Renner
FSE
2005
Springer
116views Cryptology» more  FSE 2005»
15 years 9 months ago
Narrow T-Functions
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...
Magnus Daum
SAFECOMP
2005
Springer
15 years 9 months ago
Safety Interfaces for Component-Based Systems
Abstract. This paper addresses the problems appearing in componentbased development of safety-critical systems. We aim at efficient reasoning about safety at system level while add...
Jonas Elmqvist, Simin Nadjm-Tehrani, Marius Minea