Publicly Auditable MPC-as-a-Service with succinct verification and universal setup

S Kanjalkar, Y Zhang, S Gandlur… - 2021 IEEE European …, 2021 - ieeexplore.ieee.org
In recent years, multiparty computation as a service (MPCaaS) has gained popularity as a
way to build distributed privacy-preserving systems like blockchain trusted parameter setup …

Prover-efficient commit-and-prove zero-knowledge SNARKs

H Lipmaa - Progress in Cryptology–AFRICACRYPT 2016: 8th …, 2016 - Springer
Zk-SNARKs (succinct non-interactive zero-knowledge arguments of knowledge) are needed
in many applications. Unfortunately, all previous zk-SNARKs for interesting languages are …

A PCP Theorem for Interactive Proofs and Applications

G Arnon, A Chiesa, E Yogev - … International Conference on the Theory and …, 2022 - Springer
The celebrated PCP Theorem states that any language in NP can be decided via a verifier
that reads O (1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a …

Efficient culpably sound NIZK shuffle argument without random oracles

P Fauzi, H Lipmaa - Cryptographers' Track at the RSA Conference, 2016 - Springer
One way to guarantee security against malicious voting servers is to use NIZK shuffle
arguments. Up to now, only two NIZK shuffle arguments in the CRS model have been …

Enhancing privacy protection: set membership, range proofs, and the extended access control

R Chaabouni - 2017 - infoscience.epfl.ch
Privacy has recently gained an importance beyond the field of cryptography. In that regard,
the main goal behind this thesis is to enhance privacy protection. All of the necessary …

Succinct publicly auditable MPC with universal setup

SM Kanjalkar - 2020 - ideals.illinois.edu
In recent years, Multiparty computation as a service (MPCSaaS) is gaining popularity as a
promising approach for building privacy-preserving communication systems. Although there …