搜索结果: 1-8 共查到“军事学 CDH”相关记录8条 . 查询时间(0.049 秒)
We show a new general approach for constructing maliciously secure two-round oblivious transfer (OT). Specifically, we provide a generic sequence of transformations to upgrade a very basic notion of t...
Reusable Designated-Verifier NIZKs for all NP from CDH
cryptographic protocols Zero-knowledge
2019/3/4
Non-interactive zero-knowledge proofs (NIZKs) are a fundamental cryptographic primitive. Despite a long history of research, we only know how to construct NIZKs under a few select assumptions, such as...
A Constant-Size Signature Scheme with a Tighter Reduction from the CDH Assumption
digital signatures the CDH assumption trapdoor commitments
2017/11/22
We present a signature scheme with the tightest security-reduction among known constant-size signature schemes secure under the computational Diffie-Hellman (CDH) assumption. It is important to reduce...
Efficient and Universally Composable Protocols for Oblivious Transfer from the CDH Assumption
Oblivious Transfer Universally Composable Security
2017/10/16
Oblivious Transfer (OT) is a simple, yet fundamental primitive which suffices to achieve almost every cryptographic application. In a recent work (Latincrypt `15), Chou and Orlandi (CO) present the mo...
FHPKE with Zero Norm Noises based on DLA&CDH
fully homomorphic public-key encryption discrete logarithm assimption computational Diffie–Hellman assumption
2016/7/29
In this paper I propose the fully homomorphic public-key encryption(FHPKE) scheme with zero norm noises that is based on the discrete logarithm assumption(DLA) and computational Diffie–Hellman assumpt...
Bit Security of the CDH Problems over Finite Field
CDH Diffie-Hellman problem d-th CDH problem
2016/1/7
It is a long-standing open problem to prove the existence of (deterministic) hard-core predicates
for the Computational Diffie-Hellman (CDH) problem over finite fields, without resorting to
the gene...
Unique Signature with Short Output from CDH Assumption
verifiable random function bilinear map random oracle model
2015/12/23
We give a simple and efficient construction of unique signature
on groups equipped with bilinear map. In contrast to prior works,
our proof of security is based on computational Diffie-Hellman probl...
An Efficient CDH-based Signature Scheme With a Tight Security Reduction
Public-key cryptography signature schemes discrete logarithm problem
2009/1/15
At Eurocrypt ’03, Goh and Jarecki showed that, contrary
to other signature schemes in the discrete-log setting, the EDL signature
scheme has a tight security reduction, namely to the Computational
...