Results 81 to 90 of about 1,230 (176)
Provably Authenticated Group Diffie-Hellman Key Exchange: The Dynamic Case (Extended Abstract) [PDF]
, 2001 Dynamic group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to work in a scenario in which the group membership is not known in advance but where parties may join and may also leave the multicast group at any given time ...
Chevassut, Olivier +5 more
core
Research on Bilinear Diffie-Hellman Problem
工程科学与技术, 2006 :To construct BDH (Bilinear Diffie-Hellman) parameter generator in key evolving schemes, the security of BDH problem was researched.The origin of BDH problem was reviewed.
doaj
Collusion-Tolerable and Efficient Privacy-Preserving Time-Series Data Aggregation Protocol
International Journal of Distributed Sensor Networks, 2016 Many miraculous ideas have been proposed to deal with the privacy-preserving time-series data aggregation problem in pervasive computing applications, such as mobile cloud computing.
Yongkai Li +3 more
doaj +1 more source
Elliptic curve discrete logarithm problem over small degree extension fields. Application to the static Diffie–Hellman problem on E(Fq5) [PDF]
, 2010 In 2008 and 2009, Gaudry and Diem proposed an index calculus method for the resolution of the discrete logarithm on the group of points of an elliptic curve defined over a small degree extension field Fqn.
Antoine Joux, Vanessa Vitse
core
Efficient certificateless multi-receiver anonymous signcryption scheme
Tongxin xuebao, 2016 To solve the private key escrow problem of identity-based multi-receiver signcryption schemes,the security model for multi-receiver signcryption scheme was constructed,and then a certificateless multi-receiver signcryption scheme based on ECC was ...
Yan-lin QIN, Xiao-ping WU, Wei HU
doaj +2 more sources
Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem [PDF]
In the (preprocessing) Decisional Diffie-Hellman (DDH) problem, we are given a cyclic group $G$ with a generator $g$ and a prime order $N$, and we want to prepare some advice of size $S$, such that we can efficiently distinguish $(g^{x},g^{y},g^{xy ...
Yuping Ye +4 more
core
The Computational Square-Root Exponent Problem- Revisited [PDF]
, 2011 In this paper, we revisit the Computational Square-Root Exponent Problem (CSREP), and give a more generic condition such that CSREP is polynomial-time equivalent to the Computational Diffie-Hellman Problem (CDHP) in the group with prime order.
Fangguo Zhang
core
An Efficient Identity-Based Aggregate Signature Scheme
工程科学与技术, 2011 :Security analyses of an ID-based aggregate signature scheme presented by Song, Kim, Lee and Yoon were given in this paper. It is found that the scheme is universally forgeable.
Du Hong-Zhen
doaj
SoK: The Problem Landscape of SIDH [PDF]
, 2018 The Supersingular Isogeny Diffie-Hellman protocol (SIDH) has recently been the subject of increased attention in the cryptography community. Conjecturally quantum-resistant, SIDH has the feature that it shares the same data flow as ordinary Diffie ...
David Jao, David Urbanik
core
Tongxin xuebao, 2014 Certificate less sequential multi-signature scheme could resolve the problem of authentication of recommendation information transmitted through trust train.Qin yan-lin，et al proposed an efficient certificateless sequential multi-signature scheme，and ...
Yan XU +3 more
doaj +2 more sources