Sciweavers

128 search results - page 21 / 26
» Weak Verifiable Random Functions
Sort
View
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 9 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
EUROCRYPT
2006
Springer
14 years 7 days ago
Our Data, Ourselves: Privacy Via Distributed Noise Generation
In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to crea...
Cynthia Dwork, Krishnaram Kenthapadi, Frank McSher...
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
11 years 11 months ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman
ICPR
2004
IEEE
14 years 9 months ago
An Undecimated Wavelet Transform Based Denoising, PPCA Based Pulse Modeling and Detection-Classification of PD Signals
Authors Address the problem of recognition and retrieval of relatively weak industrial signal such as Partial Discharges (PD) buried in excessive noise. The major bottleneck being...
Pradeep Kumar Shetty, T. S. Ramu
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
13 years 8 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial