87 search results - page 10 / 18 » A Verifiable Random Function with Short Proofs and Keys |
PKC
2007
Springer
15 years 3 months ago
2007
Springer
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
93
Voted
ENTCS
2006
14 years 9 months ago
2006
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
ACNS
2010
Springer
15 years 2 months ago
2010
Springer
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
72
Voted
ENTCS
2006
14 years 9 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
106
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Consider the minimum mean-square error (MMSE) of estimating an arbitrary random variable from its observation contaminated by Gaussian noise. The MMSE can be regarded as a function...