Carla Ràfols
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Carla Ràfols has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Alex Escala
Dept. Matemàtica Aplicada IV Universitat Politècnica de Catalunya Spain
2 shared publications - Alexandros Zacharakis
University of Potsdam
2 shared publications - Alonso González
Universidad de Chile
2 shared publications - Benoît Libert
Université catholique de Louvain
2 shared publications Gottfried Herold
Ruhr-Universität Bochum
2 shared publications- Javier Herranz
Universitat Politecnica de Catalunya
2 shared publications
Latest Publications
- 27 September 2026
- Published by Springer Nature
- p. 598-618
Proof-Carrying Data via Holography Accumulation
- 27 September 2026
- Published by Springer Nature
- p. 598-618
Proof-Carrying Data via Holography Accumulation
- Open Access
- 3 August 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (2)
Improving Function-Hiding Functional Commitments
Function-hiding functional commitment schemes allow one party to commit to a private function f and later prove f(x)=y for public x and y without revealing additional information about the function. We construct efficient function-hiding functional commitment schemes for arithmetic circuits of bounded size that achieve proof sizes below 1.6 kB—over an order of magnitude smaller than previous constructions—while simultaneously reducing proving and verification times. We achieve these results by introducing a novel information-theoretic interactive proof system called Polynomial Interactive Oracle Proofs with Randomized Indexer (rPHPs). By compiling rPHPs with commit-and-prove zkSNARKs, we are able to leverage relaxed zero-knowledge notions for our building blocks. This approach eliminates the overhead of strict privacy requirements of prior work, directly translating into improved efficiency in both communication and computation.
- 3 August 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (2)
Open AccessImproving Function-Hiding Functional Commitments
Function-hiding functional commitment schemes allow one party to commit to a private function f and later prove f(x)=y for public x and y without revealing additional information about the function. We construct efficient function-hiding functional commitment schemes for arithmetic circuits of bounded size that achieve proof sizes below 1.6 kB—over an order of magnitude smaller than previous constructions—while simultaneously reducing proving and verification times. We achieve these results by introducing a novel information-theoretic interactive proof system called Polynomial Interactive Oracle Proofs with Randomized Indexer (rPHPs). By compiling rPHPs with commit-and-prove zkSNARKs, we are able to leverage relaxed zero-knowledge notions for our building blocks. This approach eliminates the overhead of strict privacy requirements of prior work, directly translating into improved efficiency in both communication and computation.
- Open Access
- 8 January 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (4)
FLIP-and-Prove R1CS
We present the first folding framework that achieves sub-linear verification and communication when a single prover must convince a verifier of $k$ independent R1CS instances. FLIP (Fold-Inner-Product) folds the $k$ instance–witness pairs in only $\log k$ rounds. Built on the homomorphic two-tier commitment of Abe et al. (CRYPTO 2010), FLIP transmits $O(\log k)$ group elements. r-Groth is a commit-and-prove variant of Groth16 that natively handles relaxed R1CS. It retains Groth16’s three-element proof and two pairing checks, requires only a slightly modified (instance-independent) trusted setup, and does not rely on elliptic-curve cycles or foreign-field arithmetic. Combined, FLIP+rGroth replace the $k-1$ extra Groth16 proofs demanded by aggregation schemes and avoid the heavy verifier-in-circuit logic of recursive systems. The total prover work is essentially one Groth16 run plus light folding, while the verifier processes $O(\log k)$ group elements and two pairings. This design is immediately applicable to roll-ups, Proof-of-Space, and other “proving-as-a-service” scenarios where all witnesses reside on a single machine.- 8 January 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (4)
Open AccessFLIP-and-Prove R1CS
We present the first folding framework that achieves sub-linear verification and communication when a single prover must convince a verifier of $k$ independent R1CS instances. FLIP (Fold-Inner-Product) folds the $k$ instance–witness pairs in only $\log k$ rounds. Built on the homomorphic two-tier commitment of Abe et al. (CRYPTO 2010), FLIP transmits $O(\log k)$ group elements. r-Groth is a commit-and-prove variant of Groth16 that natively handles relaxed R1CS. It retains Groth16’s three-element proof and two pairing checks, requires only a slightly modified (instance-independent) trusted setup, and does not rely on elliptic-curve cycles or foreign-field arithmetic. Combined, FLIP+rGroth replace the $k-1$ extra Groth16 proofs demanded by aggregation schemes and avoid the heavy verifier-in-circuit logic of recursive systems. The total prover work is essentially one Groth16 run plus light folding, while the verifier processes $O(\log k)$ group elements and two pairings. This design is immediately applicable to roll-ups, Proof-of-Space, and other “proving-as-a-service” scenarios where all witnesses reside on a single machine. - Open Access
- 7 July 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (2)
Baloo: Algebraic Lookup Arguments
We present Baloo, a protocol for lookup tables where the prover work is linear on the number of lookups and independent of the table size. Baloo is built over previous lookup arguments, and the framework for SNARKs from Ràfols and Zapico (CRYPTO 21). Our protocol supports commit-and-prove expansions: the prover selects the subtable containing the elements used in the lookup, that is unknown to the verifier, commits to it and later proves its relation with the committed elements. This feature makes Baloo especially suitable for proving input-output relations on hash functions, and in particular to instantiate the Ethereum Virtual Machine (EVM).
- 7 July 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (2)
Open AccessBaloo: Algebraic Lookup Arguments
We present Baloo, a protocol for lookup tables where the prover work is linear on the number of lookups and independent of the table size. Baloo is built over previous lookup arguments, and the framework for SNARKs from Ràfols and Zapico (CRYPTO 21). Our protocol supports commit-and-prove expansions: the prover selects the subtable containing the elements used in the lookup, that is unknown to the verifier, commits to it and later proves its relation with the committed elements. This feature makes Baloo especially suitable for proving input-output relations on hash functions, and in particular to instantiate the Ethereum Virtual Machine (EVM).
- Open Access
- 5 September 2023
- Published by Springer Nature in International Journal of Information Security
- Vol. 23 (1) , 431-445
Simulation extractable versions of Groth’s zk-SNARK revisited
Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) are the most efficient proof systems in terms of proof size and verification. Currently, Groth’s scheme from EUROCRYPT 2016, $$\textsf{Groth16}$$ , is the state-of-the-art and is widely deployed in practice. $$\textsf{Groth16}$$ is originally proven to achieve knowledge soundness, which does not guarantee the non-malleability of proofs. There has been considerable progress in presenting new zk-SNARKs or modifying $$\textsf{Groth16}$$ to efficiently achieve strong Simulation extractability, which is shown to be a necessary requirement in some applications. In this paper, we revise the Random oracle based variant of $$\textsf{Groth16}$$ proposed by Bowe and Gabizon, BG18, the most efficient one in terms of prover efficiency and CRS size among the candidates, and present a more efficient variant that saves 2 pairings in the verification and 1 group element in the proof. This supersedes our preliminary construction, presented in CANS 2020 (Baghery et al. in CANS 20, volume 12579 of LNCS, Springer, Heidelberg. pp 453-461, 2020), which saved 1 pairing in the verification, and was proven in the generic group model. Our new construction also improves on BG18 in that our proofs are in the algebraic group model with Random Oracles and reduces security to standard computational assumptions in bilinear groups (as opposed to using the full power of the generic group model (GGM)). We implement our proposed simulation extractable zk-SNARK (SE zk-SNARK) along with BG18 in the library, and compare the efficiency of our scheme with some related works. Our empirical experiences confirm that our SE zk-SNARK is more efficient than all previous simulation extractable (SE) schemes in most dimensions and it has very close efficiency to the original $$\textsf{Groth16}$$ .- 5 September 2023
- Published by Springer Nature in International Journal of Information Security
- Vol. 23 (1) , 431-445
Open AccessSimulation extractable versions of Groth’s zk-SNARK revisited
Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) are the most efficient proof systems in terms of proof size and verification. Currently, Groth’s scheme from EUROCRYPT 2016, $$\textsf{Groth16}$$ , is the state-of-the-art and is widely deployed in practice. $$\textsf{Groth16}$$ is originally proven to achieve knowledge soundness, which does not guarantee the non-malleability of proofs. There has been considerable progress in presenting new zk-SNARKs or modifying $$\textsf{Groth16}$$ to efficiently achieve strong Simulation extractability, which is shown to be a necessary requirement in some applications. In this paper, we revise the Random oracle based variant of $$\textsf{Groth16}$$ proposed by Bowe and Gabizon, BG18, the most efficient one in terms of prover efficiency and CRS size among the candidates, and present a more efficient variant that saves 2 pairings in the verification and 1 group element in the proof. This supersedes our preliminary construction, presented in CANS 2020 (Baghery et al. in CANS 20, volume 12579 of LNCS, Springer, Heidelberg. pp 453-461, 2020), which saved 1 pairing in the verification, and was proven in the generic group model. Our new construction also improves on BG18 in that our proofs are in the algebraic group model with Random Oracles and reduces security to standard computational assumptions in bilinear groups (as opposed to using the full power of the generic group model (GGM)). We implement our proposed simulation extractable zk-SNARK (SE zk-SNARK) along with BG18 in the library, and compare the efficiency of our scheme with some related works. Our empirical experiences confirm that our SE zk-SNARK is more efficient than all previous simulation extractable (SE) schemes in most dimensions and it has very close efficiency to the original $$\textsf{Groth16}$$ . - Open Access
- 7 July 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (11) , 1-2
Guest editorial: Special issue on Mathematics of Zero-Knowledge
- 7 July 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (11) , 1-2
Open AccessGuest editorial: Special issue on Mathematics of Zero-Knowledge
- 1 January 2022
- Published by Springer Nature
- p. 189-219
Linear-Map Vector Commitments and Their Practical Applications
- 1 January 2022
- Published by Springer Nature
- p. 189-219
Linear-Map Vector Commitments and Their Practical Applications
- 11 August 2021
- Published by Springer Nature
- p. 774-804
An Algebraic Framework for Universal and Updatable SNARKs
- 11 August 2021
- Published by Springer Nature
- p. 774-804
An Algebraic Framework for Universal and Updatable SNARKs
- 5 July 2020
- Published by Springer Nature
- Vol. 12174, 24-44
Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
This paper constructs unbounded simulation sound proofs for boolean circuit satisfiability under standard assumptions with proof size \(O(n+d)\) bilinear group elements, where d is the depth and n is the input size of the circuit. Our technical contribution is to add unbounded simulation soundness to a recent NIZK of González and Ràfols (ASIACRYPT’19) with very small overhead. Our new scheme can be used to construct the most efficient Signature-of-Knowledge based on standard assumptions that also can be composed universally with other cryptographic protocols/primitives.- 5 July 2020
- Published by Springer Nature
- Vol. 12174, 24-44
Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
This paper constructs unbounded simulation sound proofs for boolean circuit satisfiability under standard assumptions with proof size \(O(n+d)\) bilinear group elements, where d is the depth and n is the input size of the circuit. Our technical contribution is to add unbounded simulation soundness to a recent NIZK of González and Ràfols (ASIACRYPT’19) with very small overhead. Our new scheme can be used to construct the most efficient Signature-of-Knowledge based on standard assumptions that also can be composed universally with other cryptographic protocols/primitives.