3228 search results - page 504 / 646 » Computationally Sound Proofs |
CIE
2006
Springer
14 years 20 days ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
LREC
2010
13 years 10 months ago
2010
A lot of research effort has been spent on the development of emotion theories and modeling, however, their suitability and applicability to expressions in human computer interact...
STRINGOLOGY
2008
13 years 10 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
ICISC
2004
13 years 10 months ago
2004
We propose a new broadcast encryption scheme based on polynomial interpolations. Our scheme, obtained from the Naor-Pinkas scheme by partitioning the user set and interpolating mul...
CCS
2010
ACM
13 years 9 months ago
2010
ACM
Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation,...