62 search results - page 5 / 13 » Zero-Knowledge Sets with Short Proofs |
EUROCRYPT
2009
Springer
14 years 9 months ago
2009
Springer
The notion of Zero Knowledge Proofs (of knowledge) [ZKP] is central to cryptography; it provides a set of security properties that proved indispensable in concrete protocol design...
IACR
2011
12 years 8 months ago
2011
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
ENTCS
2006
13 years 8 months ago
2006
Motivated by the concerns of theorem-proving, we generalise the notion of proof tree to that of hierarchical proof tree. Hierarchical trees extend ordinary trees by adding partial...
CMA
2010
13 years 6 months ago
2010
It is shown that the Clar number can be arbitrarily larger than the cardinality of a maximal alternating set. In particular, a maximal alternating set of a hexagonal system need n...
TAP
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. We consider the problem of test generation for Boolean combinational circuits. We use a novel approach based on the idea of treating tests as a proof encoding rather than...