530 search results - page 68 / 106 » Universal randomized switching |
119
click to vote
CCS
2005
ACM
15 years 9 months ago
2005
ACM
We introduce a new cryptographic primitive, called insubvertible encryption, that produces ciphertexts which can be randomized without the need of any key material. Unlike plain u...
163
click to vote
CTRSA
2005
Springer
15 years 9 months ago
2005
Springer
Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the self-authenticating property of digital signatures. An extended concept – the convertible un...
148
click to vote
COLT
2001
Springer
15 years 8 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...
122
click to vote
STOC
1997
ACM
15 years 8 months ago
1997
ACM
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
124
click to vote
SOCRATES
2008
15 years 5 months ago
2008
External representations can be powerful to support learners' collaborative knowledge construction. They can focus learners on aspects which are particularly important for th...