612 search results - page 45 / 123 » Hardness assumptions in the foundations of theoretical compu... |
GI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract: Recently, Distributed Hash Tables evolved to a preferred approach for decentralized data management in widely distributed systems. Due to their crucial characteristics â€...
FOCS
2002
IEEE
14 years 25 days ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ËœO(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
CSR
2010
Springer
14 years 20 days ago
2010
Springer
We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimi...
GI
2009
Springer
14 years 14 days ago
2009
Springer
: In many tracking applications, the extent of the target object is neglected and it is assumed that the received measurements stem from a point source. However, modern sensors are...
FOCS
1999
IEEE
14 years 5 days ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...