A New Gradual Secret Sharing Scheme with Diverse Access Structure

Zarepour-Ahmadabadi, Jamal; Shiri, Mohammad Ebrahim; Miri, Ali; Latif, Alimohammad

doi:10.1007/s11277-017-5187-y

Cited by 3 publications

(2 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lemma 1: If the CDH assumption is true on an elliptic curve, then the proposed tripartite authenticated key agreement protocol in this paper is a secure Tri-KA protocol. Proof: From the equations in (20) and 27, we can determine that protocol participants in matching sessions obtain the same final session key, which meets the first condition in definition 3. Next, we should prove that the proposed tripartite authenticated key agreement protocol meets the second condition in definition 3.…”

Section: A Security Proof Of the Proposed Tripartite Authenticated Kmentioning

confidence: 99%

“…Shamir's scheme used Lagrange interpolation, while Blakley's scheme was based on the intersection of multiple multidimensional spaces. Subsequently, researchers have designed secret sharing schemes based on the Chinese Remainder Theorem (CRT) [19], [20] and Attribute-based Encryption (ABE) [21]. The above schemes are also referred to as (t, n) threshold cryptography.…”

Section: ) Secret Sharing Schemementioning

confidence: 99%

See 1 more Smart Citation

Key Escrow Protocol Based on a Tripartite Authenticated Key Agreement and Threshold Cryptography

Wang

et al. 2019

IEEE Access

View full text Add to dashboard Cite

While instant messaging systems bring convenience to people's lives and work, they also make it easier for malicious users to discuss and plot illegal activities. Therefore, determining how to balance the privacy protection requirements of user communication in the network with the authorized monitoring requirements of law enforcement agencies (LEAs) is a meaningful task. To solve this problem, a new tripartite authenticated key agreement (Tri-AKA) protocol and a session key escrow scheme based on threshold cryptography and the new Tri-AKA protocol were proposed. In the proposed scheme, the LEA participates as a normal user in the key agreement process of two users and uses (t, n) threshold cryptography to share its ephemeral private key with n key escrow agents (KEAs). When necessary, the LEA can combine t KEAs to recover the specified session key and decrypt the communications, thereby preventing malicious administrators in the LEA from arbitrarily monitoring user communications. Finally, we proved the security of the proposed Tri-AKA protocol under the Computational Diffie-Hellman (CDH) assumption with the Random Oracle Model and the security of the proposed key escrow scheme under the Elliptic Curve Discrete Logarithm (ECDL) assumption. Analysis of our session key escrow scheme and comparison with other schemes show that our scheme can avoid the ''once monitor, monitor forever'' scenario and achieve finegrained control in each session. Moreover, our scheme has low storage overhead for each KEA.

show abstract

Section: A Security Proof Of the Proposed Tripartite Authenticated Kmentioning

confidence: 99%

Section: ) Secret Sharing Schemementioning

confidence: 99%