154 search results - page 4 / 31 » Computing universal models under guarded TGDs |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly ve...
COLT
2001
Springer
14 years 2 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
ACNS
2007
Springer
14 years 4 months ago
2007
Springer
Many protocols that are based on homomorphic encryption are private only if a client submits inputs from a limited range S. Conditional disclosure of secrets (CDS) helps to overcom...
AGP
2010
IEEE
13 years 7 months ago
2010
IEEE
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...