793 search results - page 125 / 159 » Argumentation and standards of proof |
ICFP
2012
ACM
12 years 1 months ago
2012
ACM
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
TCC
2009
Springer
14 years 11 months ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
EUROPKI
2009
Springer
13 years 8 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
IACR
2011
12 years 10 months ago
2011
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
ECOOP
2010
Springer
14 years 3 months ago
2010
Springer
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...