Broadcast encryption with dealership (BED) introduced by Gritti et al. (2015) is a proficient cryptographic primitive which involves a third party called as a dealer and creates a business opportunity for the dealer in broadcast services. Designing a BED is a tough task due to its various security requirements. Existing BED of Gritti et al. (2015). requires to get the user’s response to detect a dishonest dealer which is not practical in many cases. Acharya and Dutta solved the problem and proposed a BED scheme using random oracles. This brings up the question of whether it is possible to generate a secure BED without using the random oracle. Fortunately, we have found positive results. We have proposed two constructions in the standard model. Our first scheme is semi-static secure whereas the second one is the first adaptive secure construction in the standard model. All of our constructions provide group privacy by hiding the group of users and provide the maximum number of accountability by restricting the dealer from generating a group token involving a set of users having cardinality greater than a threshold value. We have provided concrete security proof of both of our constructions under key indistinguishability security game. Moreover, we have implemented our schemes and compared with existing schemes.

由Gritti等人介绍的带有代理商的广播加密（BED）。（2015）是一种熟练的加密原语，涉及称为交易商的第三方，并为广播服务中的交易商创造了商机。由于其各种安全要求，设计BED是一项艰巨的任务。Gritti等人的现有BED。（2015）。要求获得用户的响应以检测不诚实的经销商，这在许多情况下不切实际。Acharya和Dutta解决了这个问题，并提出了使用随机预言机的BED方案。这就提出了一个问题，是否可以在不使用随机预言机的情况下生成安全的BED。幸运的是，我们已经找到了积极的结果。我们在标准模型中提出了两种构造。我们的第一个方案是半静态的安全，而第二个是标准模型中的第一个自适应安全构造。我们所有的构造都通过隐藏用户组来提供组隐私，并通过限制经销商生成涉及基数大于阈值的一组用户的组令牌来提供最大数量的责任。在关键不可区分性安全游戏下，我们已为我们的两种结构提供了具体的安全性证明。此外，我们已经实施了我们的计划，并与现有计划进行了比较。