Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile
programs into unintelligible ones while preserving functionality. It is a fascinating and …

There is surprisingly little consensus on the precise role of the generator g in group-based
assumptions such as DDH. Some works consider g to be a fixed part of the group …

We provide constructions of multilinear groups equipped with natural hard problems from
indistinguishability obfuscation, homomorphic encryption, and NIZKs. This complements …

Access control and authorization in universal basic services is one of the main security
issues in distributed systems. In particular, access control in distributed systems, such as in …

Existing protocols for non-interactive multi-party key exchange either (1) support a bounded
number of users,(2) require a trusted setup, or (3) rely on knowledge-type assumptions. We …

Abstract The Diffie–Hellman key exchange scheme is one of the earliest and most widely
used public-key primitives. Its underlying algebraic structure is a cyclic group and its security …

A bilinear map whose domain and target sets are identical is called a self-bilinear map.
Original self-bilinear maps are defined over cyclic groups. Since the map itself reveals …

The first candidate indistinguishability obfuscator (iO) of Garg et al.(FOCS 2013) changed
the previously pessimistic attitude towards general-purpose cryptographic obfuscation. The …

A bilinear map whose domain and target sets are identical is called a self-bilinear map.
Original self-bilinear maps are defined over cyclic groups. Since the map itself reveals …

混淆电路(garbled circuits) 和混淆(obfuscation) 是密码研究领域中两个非常重要的工具.
混淆电路是由Yao 在安全两方计算问题中提出的一种构造方法发展而来, 混淆则是从代码混淆 …