Sciweavers

954 search results - page 44 / 191
» On the Security of ''Golden'' Cryptography
Sort
View
INFOCOM
2012
IEEE
13 years 8 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
EUROCRYPT
2012
Springer
13 years 5 days ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
ACNS
2010
Springer
155views Cryptology» more  ACNS 2010»
15 years 1 months ago
Redactable Signatures for Tree-Structured Data: Definitions and Constructions
ded abstract of this paper appears in Applied Cryptography and Network Security
Christina Brzuska, Heike Busch, Özgür Da...
RFIDSEC
2010
14 years 7 months ago
Tree-Based RFID Authentication Protocols Are Definitively Not Privacy-Friendly
Authentication for low-cost Radio-Frequency IDentification (RFID) is a booming research topic. The challenge is to develop secure protocols using lightweight cryptography, yet ensu...
Gildas Avoine, Benjamin Martin 0002, Tania Martin
TCC
2005
Springer
176views Cryptology» more  TCC 2005»
15 years 3 months ago
How to Securely Outsource Cryptographic Computations
We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a comp...
Susan Hohenberger, Anna Lysyanskaya