XMSS-a practical forward secure signature scheme based on minimal security assumptions
J Buchmann, E Dahmen, A Hülsing - Post-Quantum Cryptography: 4th …, 2011 - Springer
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 …
and practical signature scheme with minimal security requirements: a pseudorandom and a …
A comprehensive survey on edge data integrity verification: Fundamentals and future trends
Recent advances in edge computing (EC) have pushed cloud-based data caching services
to edge; however, such emerging edge storage comes with numerous challenging and …
to edge; however, such emerging edge storage comes with numerous challenging and …
W-OTS+–shorter signatures for hash-based signature schemes
A Hülsing - Progress in Cryptology–AFRICACRYPT 2013: 6th …, 2013 - Springer
We present W-OTS+, a Winternitz type one-time signature scheme (W-OTS). We prove that
W-OTS+ is strongly unforgeable under chosen message attacks in the standard model. Our …
W-OTS+ is strongly unforgeable under chosen message attacks in the standard model. Our …
Fully secure unbounded inner-product and attribute-based encryption
T Okamoto, K Takashima - International Conference on the Theory and …, 2012 - Springer
In this paper, we present the first inner-product encryption (IPE) schemes that are
unbounded in the sense that the public parameters do not impose additional limitations on …
unbounded in the sense that the public parameters do not impose additional limitations on …
On the security of the Winternitz one-time signature scheme
J Buchmann, E Dahmen, S Ereth… - … Journal of Applied …, 2013 - inderscienceonline.com
We show that the Winternitz one-time signature scheme is existentially unforgeable under
adaptive chosen message attacks when instantiated with a family of pseudorandom …
adaptive chosen message attacks when instantiated with a family of pseudorandom …
Asymptotically efficient lattice-based digital signatures
V Lyubashevsky, D Micciancio - Theory of Cryptography Conference, 2008 - Springer
We give a direct construction of digital signatures based on the complexity of approximating
the shortest vector in ideal (eg, cyclic) lattices. The construction is provably secure based on …
the shortest vector in ideal (eg, cyclic) lattices. The construction is provably secure based on …
Computing on authenticated data
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 …
encryption, we present a framework for computing on authenticated data via the notion of …
Hash based digital signature schemes
We discuss various issues associated with signature schemes based solely upon hash
functions. Such schemes are currently attractive in some limited applications, but their …
functions. Such schemes are currently attractive in some limited applications, but their …
Computing on authenticated data: New privacy definitions and constructions
Homomorphic signatures are primitives that allow for public computations on authenticated
data. At TCC 2012, Ahn et al. defined a framework and security notions for such systems. For …
data. At TCC 2012, Ahn et al. defined a framework and security notions for such systems. For …
Efficient completely context-hiding quotable and linearly homomorphic signatures
Homomorphic signatures are primitives that allow for public computations for a class of
specified predicates over authenticated data. An enhanced privacy notion, called complete …
specified predicates over authenticated data. An enhanced privacy notion, called complete …