163 search results - page 7 / 33 » Computationally Convincing Proofs of Knowledge |
134
Voted
CRYPTO
2011
Springer
14 years 17 days ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
104
click to vote
ECCC
2000
15 years 18 days ago
2000
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...
97
Voted
CSR
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we classify several algorithmic problems in group theory in the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to ...
INFORMATICALT
2010
14 years 11 months ago
2010
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veri...
100
Voted
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...