Sciweavers

3552 search results - page 473 / 711
» Proof theory in the abstract
Sort
View
CIE
2006
Springer
15 years 10 months ago
Lower Bounds Using Kolmogorov Complexity
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...
Sophie Laplante
COLT
2006
Springer
15 years 10 months ago
Maximum Entropy Distribution Estimation with Generalized Regularization
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...
Miroslav Dudík, Robert E. Schapire
CRYPTO
2006
Springer
89views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Oblivious Transfer and Linear Functions
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
EUROCRYPT
2006
Springer
15 years 10 months ago
A Provable-Security Treatment of the Key-Wrap Problem
Abstract. We give a provable-security treatment for the key-wrap problem, providing definitions, constructions, and proofs. We suggest that key-wrap's goal is security in the ...
Phillip Rogaway, Thomas Shrimpton
FM
2006
Springer
127views Formal Methods» more  FM 2006»
15 years 10 months ago
Using Domain-Independent Problems for Introducing Formal Methods
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
Raymond T. Boute