Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- abstractNovember 2022
ConsensusDay '22: ACM Workshop on Developments in Consensus
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 3543–3544https://doi.org/10.1145/3548606.3563286Consensus - loosely defined as global agreement on the state of a decentralised network across its mutually untrusting participants - is an essential ingredient for decentralisation. At the same time, its scalability remains the Achilles' heel of ...
- research-articleNovember 2022
Secure Parallel Computation on Privately Partitioned Data and Applications
- Nuttapong Attrapadung,
- Hiraku Morita,
- Kazuma Ohara,
- Jacob C. N. Schuldt,
- Tadanori Teruya,
- Kazunari Tozawa
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 151–164https://doi.org/10.1145/3548606.3560695Parallel computation is an important aspect of multi-party computation, not only in terms of improving efficiency, but also in terms of providing privacy for computation involving conditional branching based on private data. While applying multi-party ...
- research-articleNovember 2022
Batching, Aggregation, and Zero-Knowledge Proofs in Bilinear Accumulators
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 2719–2733https://doi.org/10.1145/3548606.3560676An accumulator is a cryptographic primitive that allows a prover to succinctly commit to a set of values while being able to provide proofs of (non-)membership. A batch proof is an accumulator proof that can be used to prove (non-)membership of multiple ...
- research-articleNovember 2022
AntMan: Interactive Zero-Knowledge Proofs with Sublinear Communication
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 2901–2914https://doi.org/10.1145/3548606.3560667Recent works on interactive zero-knowledge (ZK) protocols provide a new paradigm with high efficiency and scalability. However, these protocols suffer from high communication overhead, often linear to the circuit size. In this paper, we proposed two new ...
- research-articleNovember 2022
Sharp: Short Relaxed Range Proofs
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 609–622https://doi.org/10.1145/3548606.3560628We provide optimized range proofs, called Sharp, in discrete logarithm and hidden order groups, based on square decomposition. In the former setting, we build on the paradigm of Couteau et al. (Eurocrypt '21) and optimize their range proof (from now on, ...
- research-articleNovember 2022
VOProof: Efficient zkSNARKs from Vector Oracle Compilers
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 3195–3208https://doi.org/10.1145/3548606.3559387The design of zkSNARKs is increasingly complicated and requires familiarity with a broad class of cryptographic and algebraic tools. This complexity in zkSNARK design also increases the difficulty in zkSNARK implementation, analysis, and optimization. ...
- research-articleNovember 2022
Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 829–841https://doi.org/10.1145/3548606.3559385Recent advances in fast protocols for vector oblivious linear evaluation (VOLE) have inspired a family of new VOLE-based lightweight designated-verifier NIZK protocols (Weng et al., S&P 2021, Baum et al., Crypto 2021, Dittmer et al., ITC 2021, Yang et ...
- research-articleNovember 2022
PSI from Ring-OLE
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 531–545https://doi.org/10.1145/3548606.3559378Private set intersection (PSI) is one of the most extensively studied instances of secure computation. PSI allows two parties to compute the intersection of their input sets without revealing anything else. Other useful variants include PSI-Payload, ...
- research-articleNovember 2022
Updatable Public Key Encryption from DCR: Efficient Constructions With Stronger Security
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 11–22https://doi.org/10.1145/3548606.3559376Forward-secure encryption (FS-PKE) is a key-evolving public-key paradigm that preserves the confidentiality of past encryptions in case of key exposure. Updatable public-key encryption (UPKE) is a natural relaxation of FS-PKE, introduced by Jost et al. (...
- research-articleNovember 2022
GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness Dichotomy
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 683–696https://doi.org/10.1145/3548606.3559375Sharding is an emerging technique to overcome scalability issues on blockchain based public ledgers. Without sharding, every node in the network has to listen to and process all ledger protocol messages. The basic idea of sharding is to parallelize the ...
- research-articleNovember 2022
Proving UNSAT in Zero Knowledge
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 2203–2217https://doi.org/10.1145/3548606.3559373Zero-knowledge (ZK) protocols enable one party to prove to others that it knows a fact without revealing any information about the evidence for such knowledge. There exist ZK protocols for all problems in NP, and recent works developed highly efficient ...
- research-articleNovember 2022
Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 293–306https://doi.org/10.1145/3548606.3559354Zero-Knowledge protocols have increasingly become both popular and practical in recent years due to their applicability in many areas such as blockchain systems. Unfortunately, public verifiability and small proof sizes of zero-knowledge protocols ...
- research-articleNovember 2022
PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 3151–3164https://doi.org/10.1145/3548606.3559348The classic asynchronous Byzantine fault tolerance (BFT) framework of Ben-Or, Kemler, and Rabin (BKR) and its descendants rely on reliable broadcast (RBC) and asynchronous binary agreement (ABA). However, BKR does not allow all ABA instances to run in ...