4850 search results - page 892 / 970 » Proof and Computation in Geometry |
101
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veri...
115
click to vote
ICIW
2009
IEEE
15 years 7 months ago
2009
IEEE
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
114
Voted
ASIACRYPT
2009
Springer
15 years 7 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
127
click to vote
WOLLIC
2009
Springer
15 years 7 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
95
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...