Name | Affiliation | Collaboration | Joint Papers | Tags | e-mail |
|---|---|---|---|---|---|
University of Edinburgh | ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines | ||||
Pompeu Fabra University | Linear-map Vector Commitments and their Practical Applications | ||||
EURECOM | Subversion-resilient enhanced privacy ID | ||||
Pompeu Fabra University | PhD grant | Caulk: Lookup Arguments in Sublinear TimeLinear-map Vector Commitments and their Practical Applications | PhD Student | arantxa.zapico@upf.edu | |
Pompeu Fabra University | RFP-010 | Linear-map Vector Commitments and their Practical Applications | Postdoc | carla.rafols@upf.edu | |
Yale University | Assistant Professor | charalampos.papamanthou@yale.edu | |||
Indian Institute of Science | What Makes Fiat--Shamir zkSNARKs (Updatable SRS) Simulation Extractable?Rinocchio: SNARKs for Ring ArithmeticECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK EnginesImpossibilities in Succinct Arguments: Black-box Extraction and More | Assistant Professor | chaya@iisc.ac.in | ||
Aarhus University | RFP | ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK EnginesZero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving LedgersStructure-Preserving Compilers from New Notions of Obfuscations | Professor | ||
Stanford | Single Secret Leader Election | ||||
Aarhus University | RFP-10 | Structure-Preserving Compilers from New Notions of Obfuscations | |||
University of Catania | On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups | Professor | |||
IMDEA | RFP-010 | On the Impossibility of Algebraic Vector Commitments in Pairing-Free GroupsIncrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized StorageSubversion-resilient enhanced privacy IDSuccinct Zero-Knowledge Batch Proofs for Set AccumulatorsWitness Encryption for Succinct Functional Commitments and Applications | ProfessorAdvisor | ||
IMDEA | Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized StorageSuccinct Zero-Knowledge Batch Proofs for Set Accumulators | ||||
Technology Innovation Institute | Rinocchio: SNARKs for Ring Arithmetic | Researcher | Eduardo.Soria-Vazquez@tii.ae | ||
IMDEA | On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups | ||||
Max Planck Institute for Security and Privacy | RFP-10 | Researcher | |||
Aarhus University | What Makes Fiat--Shamir zkSNARKs (Updatable SRS) Simulation Extractable?Encryption to the Future: A Paradigm for Sending Secret Messages to Future (Anonymous) CommitteesImpossibilities in Succinct Arguments: Black-box Extraction and MoreWitness Encryption for Succinct Functional Commitments and Applications | PhD Student | hamidreza@cs.au.dk | ||
Impossibilities in Succinct Arguments: Black-box Extraction and More | |||||
Georgetown University | Advisor | Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup | AdvisorResearcher | ||
Aarhus University | Witness-Authenticated Key Exchange Revisited: Improved Models, Simpler Constructions, Extensions to Groups | ||||
Boston University | |||||
University of Edinburgh | What Makes Fiat--Shamir zkSNARKs (Updatable SRS) Simulation Extractable? | Assistant Professor | mkohlwei@ed.ac.uk | ||
Ethereum Fondation | SnarkPack: Practical SNARK AggregationCaulk: Lookup Arguments in Sublinear Time | ||||
Aarhus University | Count Me In!
Extendability for Threshold Ring SignaturesVeksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied AssumptionsCurve Trees: Practical and Transparent Zero-Knowledge Accumulators | PhD Student | ma@cs.au.dk | ||
UCL | Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup | Assistant Professor | |||
Aarhus University | Count Me In!
Extendability for Threshold Ring Signatures | Assistant Professor | sophia.yakoubov@cs.au.dk | ||
Ecole Polytechnique | PhD Student | youssef.el-housni@inria.fr |