Sciweavers

1401 search results - page 145 / 281
» Randomness in Interactive Proofs
Sort
View
CCS
2010
ACM
14 years 11 months ago
Securing wireless sensor networks against large-scale node capture attacks
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pionee...
Tuan Manh Vu, Reihaneh Safavi-Naini, Carey William...
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
13 years 5 months ago
On the Instantiability of Hash-and-Sign RSA Signatures
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
POPL
2007
ACM
15 years 10 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 3 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
15 years 1 months ago
Indistinguishability Amplification
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner