Sciweavers

91 search results - page 7 / 19
» Bounded Key-Dependent Message Security
Sort
View
ICDCSW
2003
IEEE
14 years 2 months ago
Convergence of IPsec in Presence of Resets
IPsec is the current security standard for the Internet Protocol IP. According to this standard, a selected computer pair (p, q) in the Internet can be designated a “security ass...
Chin-Tser Huang, Mohamed G. Gouda, E. N. Elnozahy
ICALP
2005
Springer
14 years 3 months ago
Single-Key AIL-MACs from Any FIL-MAC
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
Ueli M. Maurer, Johan Sjödin
FSTTCS
2010
Springer
13 years 7 months ago
Lower bounds for Quantum Oblivious Transfer
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the disho...
André Chailloux, Iordanis Kerenidis, Jamie ...
FOCS
2007
IEEE
14 years 4 months ago
Lower Bounds on Signatures From Symmetric Primitives
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
Boaz Barak, Mohammad Mahmoody-Ghidary
INFOCOM
2009
IEEE
14 years 4 months ago
Detecting Spam Zombies by Monitoring Outgoing Messages
—Compromised machines are one of the key security threats on the Internet; they are often used to launch various security attacks such as DDoS, spamming, and identity theft. In t...
Zhenhai Duan, Peng Chen, Fernando Sanchez, Yingfei...