Sciweavers

39 search results - page 3 / 8
» Tightness of the Security Bound of CENC
Sort
View
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...
FOCS
2007
IEEE
14 years 2 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
ESORICS
2010
Springer
13 years 8 months ago
Secure Code Update for Embedded Devices via Proofs of Secure Erasure
Remote attestation is the process of verifying internal state of a remote embedded device. It is an important component of many security protocols and applications. Although previo...
Daniele Perito, Gene Tsudik
SAINT
2005
IEEE
14 years 1 months ago
A Case Study in Running a Parallel Branch and Bound Application on the Grid
This paper presents a case study to effectively run a parallel branch and bound application on the Grid. The application discussed in this paper is a fine-grain application and is...
Kento Aida, Tomotaka Osumi
JMLR
2010
198views more  JMLR 2010»
13 years 2 months ago
Online Anomaly Detection under Adversarial Impact
Security analysis of learning algorithms is gaining increasing importance, especially since they have become target of deliberate obstruction in certain applications. Some securit...
Marius Kloft, Pavel Laskov