Coercion Resistance in a Practical Secret Voting Scheme for Large Scale Elections. - Panagiotis Grontas; Aris Pagourtzis; Alexandros Zacharakis (ISPAN-FCST-ISCC, 2017)

Conditional Blind Signatures. - Alexandros Zacharakis; Panagiotis Grontas; Aris Pagourtzis (IACR Cryptol. ePrint Arch., 2017)

Towards everlasting privacy and efficient coercion resistance in remote electronic voting. - Panagiotis Grontas; Aris Pagourtzis; Alexandros Zacharakis; Bingsheng Zhang (IACR Cryptol. ePrint Arch., 2018)

Security models for everlasting privacy. - Panagiotis Grontas; Aris Pagourtzis; Alexandros Zacharakis (IACR Cryptol. ePrint Arch., 2019)

Updateable Inner Product Argument with Logarithmic Verifier and Applications. - Vanesa Daza; Carla Ràfols; Alexandros Zacharakis (IACR Cryptol. ePrint Arch., 2020)

Fully-Succinct Publicly Verifiable Delegation from Constant-Size Assumptions. - Alonso González; Alexandros Zacharakis (TCC (1), 2021)

Mutual Accountability Layer: Accountable Anonymity within Accountable Trust. - Vanesa Daza; Abida Haque; Alessandra Scafuro; Alexandros Zacharakis; Arantxa Zapico (IACR Cryptol. ePrint Arch., 2021)

Succinct Publicly Verifiable Computation. - Alonso González; Alexandros Zacharakis (IACR Cryptol. ePrint Arch., 2021)

Publicly auditable conditional blind signatures. - Panagiotis Grontas; Aris Pagourtzis; Alexandros Zacharakis; Bingsheng Zhang (J. Comput. Secur., 2021)

Linear-map Vector Commitments and their Practical Applications. - Matteo Campanelli; Anca Nitulescu; Carla Ràfols; Alexandros Zacharakis; Arantxa Zapico (IACR Cryptol. ePrint Arch., 2022)

Folding Schemes with Selective Verification. - Carla Ràfols; Alexandros Zacharakis (IACR Cryptol. ePrint Arch., 2022)

Succinct arguments: efficiency, assumptions and trade-offs - Alexandros Zacharakis (2022)