Compressed-protocol theory and practical application to plug & play secure algorithmics

T Attema, R Cramer - Annual International Cryptology Conference, 2020 - Springer
Abstract\varSigma-Protocols provide a well-understood basis for secure algorithmics.
Recently, Bulletproofs (Bootle et al., EUROCRYPT 2016, and Bünz et al., S&P 2018) have …

zkay: Specifying and enforcing data privacy in smart contracts

S Steffen, B Bichsel, M Gersbach, N Melchior… - Proceedings of the …, 2019 - dl.acm.org
Privacy concerns of smart contracts are a major roadblock preventing their wider adoption. A
promising approach to protect private data is hiding it with cryptographic primitives and then …

Verifiable fully homomorphic encryption

A Viand, C Knabenhans, A Hithnawi - arXiv preprint arXiv:2301.07041, 2023 - arxiv.org
Fully Homomorphic Encryption (FHE) is seeing increasing real-world deployment to protect
data in use by allowing computation over encrypted data. However, the same malleability …

Blockchain is watching you: Profiling and deanonymizing ethereum users

F Béres, IA Seres, AA Benczúr… - 2021 IEEE …, 2021 - ieeexplore.ieee.org
Ethereum is the largest public blockchain by usage. It applies an account-based model,
which is inferior to Bitcoin's unspent transaction output model from a privacy perspective …

Proof-carrying data without succinct arguments

B Bünz, A Chiesa, W Lin, P Mishra… - Advances in Cryptology …, 2021 - Springer
Proof-carrying data (PCD) is a powerful cryptographic primitive that enables mutually
distrustful parties to perform distributed computations that run indefinitely. Known …

Gemini: Elastic SNARKs for diverse environments

J Bootle, A Chiesa, Y Hu, M Orru - … on the Theory and Applications of …, 2022 - Springer
We introduce a new class of succinct arguments, that we call elastic. Elastic SNARKs allow
the prover to allocate different resources (such as memory and time) depending on the …

Non-interactive zero-knowledge for blockchain: A survey

J Partala, TH Nguyen, S Pirttikangas - IEEE Access, 2020 - ieeexplore.ieee.org
We survey the state-of-the-art non-interactive zero-knowledge argument schemes and their
applications in confidential transactions and private smart contracts on blockchain. The main …

Weak fiat-shamir attacks on modern proof systems

Q Dao, J Miller, O Wright… - 2023 IEEE Symposium on …, 2023 - ieeexplore.ieee.org
A flurry of excitement amongst researchers and practitioners has produced modern proof
systems built using novel technical ideas and seeing rapid deployment, especially in …

Correlation intractability and SNARGs from sub-exponential DDH

AR Choudhuri, S Garg, A Jain, Z Jin… - Annual International …, 2023 - Springer
We provide the first constructions of SNARGs for Batch-NP and P based solely on the sub-
exponential Decisional Diffie Hellman (DDH) assumption. Our schemes achieve poly …

Subvector commitments with application to succinct arguments

RWF Lai, G Malavolta - Advances in Cryptology–CRYPTO 2019: 39th …, 2019 - Springer
We put forward the notion of subvector commitments (SVC): An SVC allows one to open a
committed vector at a set of positions, where the opening size is independent of length of the …