915 search results - page 93 / 183 » Proof labeling schemes |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Many network applications are based on a group communications model where one party sends messages to a large number of authorized recipients and/or receives messages from mult...
FSE
2001
Springer
14 years 16 days ago
2001
Springer
In this paper, we describe new results on the security, in the Luby-Rackoff paradigm, of two modified Feistel constructions, namely the L-scheme, a construction used at various l...
ICMCS
1998
IEEE
14 years 9 days ago
1998
IEEE
Various digital watermarking techniques have been proposed in recent years as the methods to protect the copyright of multimedia data. However, as pointed out by the IBM research ...
PQCRYPTO
2010
14 years 5 hour ago
2010
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...