Succinct Arguments for Bilinear Group Arithmetic

Lai, Russell W. F.; Malavolta, Giulio; Ronge, Viktoria

doi:10.1145/3319535.3354262

Cited by 26 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We use a desktop with Intel Core i7-4790 3.60GHz CPU and 16GB RAM. Our implementations use Pedersen commitment, our SME, Boneh-Franklin IBE [7], HMAC-SHA-256 (for PRF), the argument system from Lai et al [28], and the hybrid technique in Section V-D. We set pkPRF(sk, m) as H(m) sk , where H is a full domain hash built upon HMAC-SHA-256. Note that our evaluation involves no CDB-cache for clarity and fairness.…”

Section: Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Unus pro omnibus: Multi-Client Searchable Encryption via Access Control

Wang,

Chow

2024

Proceedings 2024 Network and Distributed System Security Symposium

View full text Add to dashboard Cite

Searchable encryption lets an untrusted cloud server store keyword-document tuples encrypted by writers and conduct keyword searches with tokens from readers. Multi-writer schemes naturally offer broad applicability; however, it is unclear how to achieve the distinctive features of single-writer systems, namely, optimal search traversing only the result set and forward privacy invalidating old search tokens against any new data. Cutting-edge results by Wang and Chow (Usenix Security 2022) incur extra traversal over existing keywords and weaken forward privacy that only invalidates previous-issued search tokens periodically.We propose delegatable searchable encryption (DSE) with optimal search time for the multi-writer multi-reader setting. Beyond forward privacy, DSE supports security measures countering new integrity threats by malicious clients and keyword-guessing attacks inherent to public-key schemes. These are simultaneously made conceivable via one-time delegations of updating and/or searching power from the data owner and our tailored notion of shiftable multi-recipient counter encryption. DSE also benefits from the hybrid searchable encryption idea of Wang and Chow but at a microscopic level. Our evaluation confirms the order-ofmagnitude improvement in search time over real-world datasets.

show abstract

Section: Methodsmentioning

confidence: 99%

“…Our SME instantiation is as simple as multi-recipient ElGamal encryption. Together with the simple structure of other (encrypted) states, our DSE instantiation provides efficient integrity protection using the recent succinct arguments of knowledge for bilinear group arithmetic [28], in contrast to heavyweight circuit-based proofs.…”

Section: B Security Overviewmentioning

confidence: 99%

Unus pro omnibus: Multi-Client Searchable Encryption via Access Control

Wang,

Chow

2024

Proceedings 2024 Network and Distributed System Security Symposium

View full text Add to dashboard Cite

show abstract

“…Hoffmann et al [2] devised zero knowledge variants of the IPA tvc of Bootle et al [4] and the IPA ovc of Bünz et al [1] with almost no extra overhead. Lai et al [20] introduced a transparent inner product argument for pairing-based language. Nevertheless, the above arguments all have asymptotically linear verifier complexity.…”

Section: Our Contributionsmentioning

confidence: 99%

“…Lai et al. [20] introduced a transparent inner product argument for pairing‐based language. Nevertheless, the above arguments all have asymptotically linear verifier complexity.…”

Section: Introductionmentioning

confidence: 99%

Efficient inner product arguments and their applications in range proofs

Zhou

Zhang

Tao

et al. 2023

IET Information Security

View full text Add to dashboard Cite

Inner product arguments allow a prover to prove that the inner product of two committed vectors equals a public scalar. They are used to reduce the complexity of many cryptographic primitives, such as range proofs. Range proofs are deployed in numerous applications to prove that a committed value lies in a certain range. As core building blocks, their complexity largely determines the performance of corresponding applications. In this paper, we have optimised the inner product argument with statement including two vector commitments (IPA tvc ) and range proof of Daza et al. (PKC'20), the inner product argument with statement including only one vector commitment (IPA ovc ) of Bünz et al. (S&P 0 18). For IPA tvc , we reduce the concrete communication complexity by 2 log 2 n field elements, where n is the vector dimension. For range proofs, we reduce the concrete communication and prover complexities by about 2 log 2 m field elements and 11m field multiplications, respectively, where m is the bit length of range. For IPA ovc , we exponentially reduce the asymptotic verifier complexity from linear to logarithmic. Due to the asymptotic characteristics, our protocols are highly competitive when the vector dimension or bit length of range is large.

show abstract