Server-aided continuous group key agreement
J Alwen, D Hartmann, E Kiltz, M Mularczyk - Proceedings of the 2022 …, 2022 - dl.acm.org
Continuous Group Key Agreement (CGKA)--or Group Ratcheting--lies at the heart of a new
generation of scalable End-to-End secure (E2E) cryptographic multi-party applications. One …
generation of scalable End-to-End secure (E2E) cryptographic multi-party applications. One …
Oblivious accumulators
A cryptographic accumulator is a succinct set commitment scheme with efficient (non-)
membership proofs that typically supports updates (additions and deletions) on the …
membership proofs that typically supports updates (additions and deletions) on the …
Lattice-based dynamic universal accumulator: Design and application
Y Zhao, S Yang, X Huang - Computer Standards & Interfaces, 2024 - Elsevier
Dynamic universal accumulator is a crucial cryptography primitive. This type of accumulator
can provide a succinct witness for a member (resp. nonmember) in order to make sure …
can provide a succinct witness for a member (resp. nonmember) in order to make sure …
Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs
A Barthoulot, O Blazy, S Canard - International Conference on Cryptology …, 2024 - Springer
Cryptographic accumulators, introduced in 1993 by Benaloh and De Mare, represent a set
with a concise value and offer proofs of (non-) membership. Accumulators have evolved …
with a concise value and offer proofs of (non-) membership. Accumulators have evolved …
Towards a smart contract-based, decentralized, public-key infrastructure
C Patsonakis, K Samari, M Roussopoulos… - Cryptology and Network …, 2018 - Springer
Public-key infrastructures (PKIs) are an integral part of the security foundations of digital
communications. Their widespread deployment has allowed the growth of important …
communications. Their widespread deployment has allowed the growth of important …
Universal Vector Commitments
O Acharya, F Baldimtsi, SD Gordon, D McVicker… - … Conference on Security …, 2024 - Springer
We propose a new notion of vector commitment schemes with proofs of (non-) membership
that we call universal vector commitments. We show how to build them directly from (i) …
that we call universal vector commitments. We show how to build them directly from (i) …
Efficient Homomorphic E-Voting Based On Batch Proof Techniques—An Improvement to Secure MPC Application
K Peng - 2022 19th Annual International Conference on Privacy …, 2022 - ieeexplore.ieee.org
E-voting is an important application of secure MPC (multi-party computation) and its
achievement of security through verifiable MPC can be based on homomorphic encryption …
achievement of security through verifiable MPC can be based on homomorphic encryption …
New code-based cryptographic accumulator and fully dynamic group signature
EB Ayebie, EM Souidi - Designs, Codes and Cryptography, 2022 - Springer
A cryptographic accumulator is a cryptographic primitive which produces a succinct
aggregate of a set of elements. This type of scheme allows to produce a membership proof …
aggregate of a set of elements. This type of scheme allows to produce a membership proof …
An Efficient Zero-Knowledge Dual Membership Proof Supporting Pos-and-Neg Membership Decision
In this paper, we address the problem of secure decision of membership. We present a Zero-
Knowledge Dual Membership Proof (ZKDMP) protocol, which can support positive and …
Knowledge Dual Membership Proof (ZKDMP) protocol, which can support positive and …
基于格的高效通用累加器与被累加值的零知识证明
谭子欣， 邓燚， 马丽 - 信息安全学报, 2021 - jcs.iie.ac.cn
通用累加器作为一种具有数据压缩性质的重要密码学元件, 其多应用于隐私保护相关的区块链
系统, 身份认证系统以及各类权限管理系统. 研究发现目前已有的基于小整数解(SIS) …
系统, 身份认证系统以及各类权限管理系统. 研究发现目前已有的基于小整数解(SIS) …