Sciweavers

24 search results - page 1 / 5
» A New Sampling Protocol and Applications to Basing Cryptogra...
Sort
View
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 5 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
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
13 years 8 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
FOCS
2000
IEEE
13 years 9 months ago
Zaps and Their Applications
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
Cynthia Dwork, Moni Naor
CRYPTO
2010
Springer
158views Cryptology» more  CRYPTO 2010»
13 years 5 months ago
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...
Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit ...
WICON
2008
13 years 6 months ago
SAMPL: a simple aggregation and message passing layer for sensor networks
In recent years, wireless sensor networking has shown great promise in applications ranging from industrial control, environmental monitoring and inventory tracking. Given the res...
Anthony Rowe, Karthik Lakshmanan, Ragunathan Rajku...