2 results sorted by ID
Possible spell-corrected query: $k$-bdd assumption family
Scalable Attribute-Based Encryption Under the Strictly Weaker Assumption Family
Yuqiao Deng, Ge Song
Public-key cryptography
Attribute-Based Encryption (ABE) is a special type of public key encryption that allows users to share sensitive data efficiently through fine-grained access control. The security involved in existing ABE systems is currently insufficient. These systems are usually built on the Decisional Bilinear Diffie-Hellman (DBDH) assumption or the q-type DBDH assumption, which is stronger than the DBDH assumption. However, once the DBDH assumption is unsecure, all concerned ABEs become vulnerable to...
The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions
Karyn Benson, Hovav Shacham, Brent Waters
Public-key cryptography
Over the past decade bilinear maps have been used to build a large variety of cryptosystems.
In addition to new functionality, we have concurrently seen the emergence of many strong assumptions.
In this work, we explore how to build bilinear map cryptosystems under progressively weaker assumptions.
We propose $k$-BDH, a new family of progressively
weaker assumptions that generalizes the decisional bilinear
Diffie-Hellman (DBDH) assumption. We give evidence in the generic
group model that...
Attribute-Based Encryption (ABE) is a special type of public key encryption that allows users to share sensitive data efficiently through fine-grained access control. The security involved in existing ABE systems is currently insufficient. These systems are usually built on the Decisional Bilinear Diffie-Hellman (DBDH) assumption or the q-type DBDH assumption, which is stronger than the DBDH assumption. However, once the DBDH assumption is unsecure, all concerned ABEs become vulnerable to...
Over the past decade bilinear maps have been used to build a large variety of cryptosystems. In addition to new functionality, we have concurrently seen the emergence of many strong assumptions. In this work, we explore how to build bilinear map cryptosystems under progressively weaker assumptions. We propose $k$-BDH, a new family of progressively weaker assumptions that generalizes the decisional bilinear Diffie-Hellman (DBDH) assumption. We give evidence in the generic group model that...