Sciweavers

256 search results - page 18 / 52
» On a Generalized Notion of Mistake Bounds
Sort
View
IACR
2011
162views more  IACR 2011»
13 years 11 months ago
The Parazoa Family: Generalizing the Sponge Hash Functions
Abstract. Sponge functions were introduced by Bertoni et al. as an alternative to the classical MerkleDamg˚ard design. Many hash function submissions to the SHA-3 competition laun...
Elena Andreeva, Bart Mennink, Bart Preneel
FOSSACS
2004
Springer
15 years 5 months ago
On Recognizable Timed Languages
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
Oded Maler, Amir Pnueli
RFIDSEC
2010
14 years 10 months ago
Optimal Security Limits of RFID Distance Bounding Protocols
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
Orhun Kara, Süleyman Kardas, Muhammed Ali Bin...
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
15 years 8 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...
COLT
1999
Springer
15 years 4 months ago
Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation
The empirical error on a test set, the hold-out estimate, often is a more reliable estimate of generalization error than the observed error on the training set, the training estim...
Avrim Blum, Adam Kalai, John Langford