6 search results - page 1 / 2 » Improved Security for Linearly Homomorphic Signatures: A Gen... |
PKC
2012
Springer
11 years 6 months ago
2012
Springer
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
ASIACRYPT
2004
Springer
13 years 9 months ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diï¬...
JOC
2011
12 years 7 months ago
2011
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
TCC
2012
Springer
11 years 12 months ago
2012
Springer
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slight...
PKC
2010
Springer
13 years 8 months ago
2010
Springer
Network coding is a method for achieving channel capacity in networks. The key idea is to allow network routers to linearly mix packets as they traverse the network so that recipi...