3228 search results - page 145 / 646 » Computationally Sound Proofs |
COCO
2004
Springer
14 years 3 months ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
ASIACRYPT
2000
Springer
14 years 2 months ago
2000
Springer
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
ASIAN
2006
Springer
14 years 1 months ago
2006
Springer
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
FOSSACS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
ICFP
1999
ACM
14 years 2 months ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...