Details
Title
COMPSEC
Formal Name (French)
Laboratoire de la Sécurité du Calcul
Formal Name (English)
Laboratory for Computation Security
Lab Manager
Chiesa, Alessandro
Group ID
U14162
Affiliated authors
Bordage, Sarah
Chiesa, Alessandro
Di, Zijing
Fenzi, Giacomo
Nguyen, Ngoc Khanh
Seguini, Giorgio
Taschin, Lorenzo
Ubezio, Fabienne
Yildiz, Burcu
Zitek, Andrew Lawrence
Chiesa, Alessandro
Di, Zijing
Fenzi, Giacomo
Nguyen, Ngoc Khanh
Seguini, Giorgio
Taschin, Lorenzo
Ubezio, Fabienne
Yildiz, Burcu
Zitek, Andrew Lawrence
Institute
IINFCOM
Faculty
IC
Note
Members of COMPSEC-unit
Linked resource
https://ic.epfl.ch/
Publications
A PCP Theorem for Interactive Proofs and Applications
A Toolbox for Barriers on Interactive Oracle Proofs
BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications
Gemini: Elastic SNARKs for Diverse Environments
IOPs with Inverse Polynomial Soundness Error
Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal
On Succinct Non-interactive Arguments in Relativized Worlds
Relaxed Locally Correctable Codes With Nearly-Linear Block Length And Constant Query Complexity
Succinct Non-Interactive Arguments via Linear Interactive Proofs
Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier
See complete list of publications (13)
A Toolbox for Barriers on Interactive Oracle Proofs
BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications
Gemini: Elastic SNARKs for Diverse Environments
IOPs with Inverse Polynomial Soundness Error
Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal
On Succinct Non-interactive Arguments in Relativized Worlds
Relaxed Locally Correctable Codes With Nearly-Linear Block Length And Constant Query Complexity
Succinct Non-Interactive Arguments via Linear Interactive Proofs
Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier
See complete list of publications (13)
Record appears in
Authorities > Lab