319 search results - page 56 / 64 » Cryptographic Assumptions: A Position Paper |
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
80
Voted
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
IJNSEC
2008
14 years 9 months ago
2008
In this paper, we investigate the issues in the analysis and design of provably secure message authentication codes (MACs) Nested MAC (NMAC) and Hash based MAC (HMAC) proposed by ...
114
click to vote
BMCBI
2011
14 years 4 months ago
2011
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...
TROB
2010
14 years 4 months ago
2010
The property of form-closure of a grasp, as generally defined in the literature, is based on the assumption that contact points between the hand and the object are fixed in space. ...