3228 search results - page 143 / 646 » Computationally Sound Proofs |
EUROCRYPT
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
LPNMR
2007
Springer
14 years 4 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
APLAS
2006
ACM
14 years 4 months ago
2006
ACM
straction for Imperative Languages William L. Harrison Dept. of Computer Science, University of Missouri, Columbia, Missouri, USA. ty in programming language semantics derives fro...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
EUROCRYPT
2000
Springer
14 years 1 months ago
2000
Springer
Alice wants to prove that she is young enough to borrow money from her bank, without revealing her age. She therefore needs a tool for proving that a committed number lies in a spe...