NPNikitas Paslis
Nikitas Paslis
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Nikitas Paslis has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Carla Ràfols
Universitat Pompeu Fabra
2 shared publications - Alexandros Zacharakis
University of Potsdam
1 shared publication - Anca Nitulescu
Input Output (Singapore)
1 shared publication
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
- 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.