Sciweavers

2237 search results - page 158 / 448
» On the Security of Random Sources
Sort
View
IACR
2011
94views more  IACR 2011»
14 years 5 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
PERVASIVE
2009
Springer
16 years 1 months ago
Securing RFID Systems by Detecting Tag Cloning
Cloning of RFID tags can lead to financial losses in many commercial RFID applications. There are two general strategies to provide security: prevention and detection. The securit...
Mikko Lehtonen, Daniel Ostojic, Alexander Ilic, Fl...
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
16 years 24 days ago
Improving the Security of Quantum Protocols via Commit-and-Open
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...
Ivan Damgård, Serge Fehr, Carolin Lunemann, ...
ACNS
2008
Springer
115views Cryptology» more  ACNS 2008»
16 years 18 days ago
The Security of EPC Gen2 Compliant RFID Protocols
The increased functionality of EPC Class1 Gen2 (EPCGen2) is making this standard the de facto specification for inexpensive tags in the RFID industry. EPCGen2 supports only very b...
Mike Burmester, Breno de Medeiros
136
Voted
ICALP
2005
Springer
15 years 11 months ago
On Steganographic Chosen Covertext Security
At TCC 2005, Backes and Cachin proposed a new and very strong notion of security for public key steganography: secrecy against adaptive chosen covertext attack (SS-CCA); and posed ...
Nicholas Hopper