Cost-effective Private Linear Key Agreement with Adaptive CCA Security from Prime Order Multilinear Maps and Tracing Traitors

Mandal, Mriganka; Dutta, Ratna

doi:10.5220/0006845503560363

Cited by 3 publications

(6 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All the works [3,7,10], except the design of [13], have constant DecTm which is slightly less than ours. The DecTm in [13] is linear to N . In contrast to [3,4,6,7,10,14], our construction has less communication bandwidth and user's storage overhead (i.e., user secret-key size) as L < √ N , where L denotes a very small number of subscribers for an encryption and N stands for the total number of system users.…”

mentioning

confidence: 54%

“…Full anonymity and public-key traceability are mutually orthogonal functionalities that repudiate each other regarding the recipients' privacy. It is non-trivial to realize a secure identity-based FAnoPKTR by simply coupling identity-based FAnoBE [8,9,15] with tracing [3,4,6,7,10,13,14], leading to efficiency and security degradation [2]. The communication bandwidth grows linearly with the size of maximal subscribers in FAnoBE schemes.…”

mentioning

confidence: 99%

“…Table 1), fully anonymous BE [8,9,12,15,17] (cf. Table 2) and traceable BE [3,4,6,7,10,13,14] (cf. Table 3), our main contribution in this paper is that we are the first to achieve the adaptive IND-CCA security.…”

mentioning

confidence: 99%

“…Although the design of [12] and ours have the same parameter sizes, we emphasize that if we transform [12] into an identity-based FAnoPKTR using the (only known) generic transformation of Murat et al [2], then the storage overhead grows linearly in the square of N , which is highly inefficient. 3 shows the comparison of our scheme with the existing tracing systems [3,4,6,7,10,13,14] none of which preserves receiver's full anonymity. All the works [3,7,10], except the design of [13], have constant DecTm which is slightly less than ours.…”

mentioning

confidence: 99%

“…3 shows the comparison of our scheme with the existing tracing systems [3,4,6,7,10,13,14] none of which preserves receiver's full anonymity. All the works [3,7,10], except the design of [13], have constant DecTm which is slightly less than ours. The DecTm in [13] is linear to N .…”

mentioning

confidence: 99%

See 4 more Smart Citations

Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security

Mandal

Sarkar

Hur

et al. 2021

Information Security Practice and Experience

Self Cite

View full text Add to dashboard Cite

We aim to efficiently design a unified, cost-effective primitive exhibiting two mutually orthogonal functionalities, namely subscribed users anonymity and public-key traitor traceability in the context of Broadcast Encryption (BE), and propose an explicit construction of identity-based Fully Anonymous Public-Key Trace and Revoke (FAnoPKTR) scheme that is obtained by coupling the Identity-Based Encryption (IBE) framework with the collusion-secure optimal probabilistic fingerprinting codes. In addition to being adaptively secure, our design is proven to be INDistinguishable Chosen-Ciphertext Attack (IND-CCA) secure under asymmetric Decisional Bilinear Diffie-Hellman Type-3 (DBDH-3) assumption in standard security model without random oracles. Our asymmetric Type-3 bilinear pairing-based scheme has communication bandwidth that grows with the size of a subscriber set for any encryption, and the user secret-key size is constant. Moreover, our decryption algorithm is faster, which requires only three asymmetric pairings to recover the encrypted broadcast message.

show abstract

mentioning

confidence: 54%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security

Mandal

Sarkar

Hur

et al. 2021

Information Security Practice and Experience

Self Cite

View full text Add to dashboard Cite

show abstract

Efficient Adaptively Secure Public-Key Trace and Revoke from Subset Cover Using D$$\acute{e}$$j$$\grave{a}$$ Q Framework

Mandal

Dutta

2019

Information Security and Cryptology

View full text Add to dashboard Cite

Improved Encryption Algorithm for Public Wireless Network

Khosa,

Mathonsi,

Plessis

et al. 2024

JAIT

View full text Add to dashboard Cite

Wireless networks afford numerous benefits for productivity, due to the ease of access to information resources. A network can now be set up and changed more quickly, with less effort, and for less money. However, wireless technology also creates new threats; and alerts the existing risk profile for information security. In Wireless Fidelity (Wi-Fi), security mechanisms such as encryption algorithms play a vital role. A large amount of memory and power is consumed by those algorithms. This research study therefore proposed a Computation Efficient Secure Algorithm (CESA) that reduces the high consumption of power and memory to efficiently secure public Wi-Fi networks. The proposed CESA was based on a hash-based message authentication algorithm. A Digital Signature Algorithm (DSA) was accomplished to produce and verify signatures using the Secure Hash Algorithm (SHA). The Network Simulation-2 (NS-2) tool was used to evaluate the various settings of each algorithm, including key generation time, encryption time, and decryption time. Through the simulation, it was demonstrated that the proposed algorithm CESA outperformed both the Enhanced Diffie-Hellman (EDH) and Advanced Encryption Standard (AES) algorithms in terms of key generation time, encryption time, and decryption time. To generate the key, the proposed CESA algorithm took up to 59 s, while the EDH and AES algorithms took almost 90 s. To encrypt the data, the proposed CESA algorithm took about 98 seconds, while EDH and AES algorithms took almost 167 seconds. To decrypt the data, the proposed CESA algorithm took about 80 s, while EDH and AES algorithms took almost 160 s. Thus, the EDH and AES make CESA more robust against attacks and very rapid in handling encryption and decryption processes.

show abstract

Cost-effective Private Linear Key Agreement with Adaptive CCA Security from Prime Order Multilinear Maps and Tracing Traitors

Cited by 3 publications

References 0 publications

Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security

Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security

Efficient Adaptively Secure Public-Key Trace and Revoke from Subset Cover Using D$$\acute{e}$$j$$\grave{a}$$ Q Framework

Improved Encryption Algorithm for Public Wireless Network

Contact Info

Product

Resources

About