Sciweavers

401 search results - page 2 / 81
» Delegatable Functional Signatures
Sort
View
IACR
2011
142views more  IACR 2011»
12 years 7 months ago
XMSS - A Practical Forward Secure Signature Scheme based on Minimal Security Assumptions
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a ...
Johannes Buchmann, Erik Dahmen, Andreas Hülsi...
EUROCRYPT
2011
Springer
12 years 11 months ago
Homomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
Dan Boneh, David Mandell Freeman
TCC
2012
Springer
245views Cryptology» more  TCC 2012»
12 years 3 months ago
Secure Two-Party Computation with Low Communication
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
Ivan Damgård, Sebastian Faust, Carmit Hazay
IPL
2006
103views more  IPL 2006»
13 years 7 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
IACR
2011
90views more  IACR 2011»
12 years 7 months ago
On the Security of the Winternitz One-Time Signature Scheme
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...
Johannes Buchmann, Erik Dahmen, Sarah Ereth, Andre...