搜索结果: 1-11 共查到“军事学 short signatures”相关记录11条 . 查询时间(0.178 秒)
Weak is Better: Tightly Secure Short Signatures from Weak PRFs
weak pseudorandom functions signatures lattice-based cryptography
2017/6/15
The Boyen-Li signature scheme [Asiacrypt'16] is a major theoretical breakthrough. Via a clever homomorphic evaluation of a pseudorandom function over their verification key, they achieve a reduction l...
Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
public-key cryptography PHF
2016/5/30
Driven by the open problem raised by Hofheinz and Kiltz (Journal of Cryptology, 2012), we study the formalization of lattice-based programmable hash function (PHF), and give two types of constructions...
Short Signatures from Diffie-Hellman, Revisited: Sublinear Public Key, CMA Security, and Tighter Reduction
Diffie-Hellman Short Signatures Standard Model
2016/1/25
Designing efficient signature scheme based on the standard assumption such as the Computational
Diffie-Hellman (CDH) assumption is important both from a practical and a theoretical
point of view. Cu...
Short Signatures With Short Public Keys From Homomorphic Trapdoor Functions
lattices digital signatures homomorphic cryptography
2016/1/6
We present a lattice-based stateless signature scheme provably secure in the standard model. Our
scheme has a constant number of matrices in the public key and a single lattice vector (plus a tag) in...
Short Signatures From Weaker Assumptions
public-key cryptography / digital signatures RSA assumption q-DH assumption programmable hash functions
2012/3/28
We provide constructions of (m,1)-programmable hash functions (PHFs) for m >= 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into the generic constructi...
Short Signatures From Weaker Assumptions
digital signatures RSA assumption q-DH assumption,
2011/7/25
We provide constructions of (m,1)-programmable hash functions (PHFs) for m >= 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into the generic constructi...
Short Signatures From Weaker Assumptions
digital signatures RSA assumption q-DH assumption programmable hash functions
2011/6/9
We provide constructions of (m,1)-programmable hash functions (PHFs) for m >= 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into the generic constructi...
We describe a short signature scheme which is existentially unforgeable under a chosen
message attack without using random oracles. The security of our scheme depends on a new
complexity assumption ...
Short Signatures, Provable Security, Generic Attacks and Computational Security of Multivariate Polynomial Schemes such as HFE, Quartz and Sflash
Generic signature schemes short signatures provable security
2009/3/27
The object of this paper is the concrete security of recent
multivariate signature schemes. A major challenge is to reconcile some
”tricky” ad-hoc constructions that allow to make short signatures, ...
We construct three new signatures and prove their securities without random oracles.
They are motivated, respectively, by Boneh and Boyen [9]’s, Zhang, et al. [45]’s, and Camenisch and Lysyanskaya [1...
With computer networks spreading into a variety of new environments, the need to authenticate
and secure communication grows. Many of these new environments have particular
requirements on the appli...