Logo
    🤖

    Research Collabs

    Name
    Affiliation
    Collaboration
    Joint Papers
    Tags
    e-mail
    Akira Takahashi
    University of Edinburgh

    ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines

    Alexandros Zacharakis
    Pompeu Fabra University

    Linear-map Vector Commitments and their Practical Applications

    Antonio Faonio
    EURECOM

    Subversion-resilient enhanced privacy ID

    Arantxa Zapico
    Pompeu Fabra University

    PhD grant

    Caulk: Lookup Arguments in Sublinear TimeLinear-map Vector Commitments and their Practical Applications
    PhD Student

    arantxa.zapico@upf.edu

    Carla Ràfols
    Pompeu Fabra University

    RFP-010

    Linear-map Vector Commitments and their Practical Applications
    Postdoc

    carla.rafols@upf.edu

    Charalampos Papamanthou (Babis)
    Yale University

    Assistant Professor

    charalampos.papamanthou@yale.edu

    Chaya Ganesh
    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

    Claudio Orlandi
    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

    Dan Boneh
    Stanford

    Single Secret Leader Election

    Danilo Francati
    Aarhus University

    RFP-10

    Structure-Preserving Compilers from New Notions of Obfuscations

    Dario Catalano
    University of Catania

    On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups
    Professor

    Dario Fiore
    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

    Dimitris Kolonelos
    IMDEA

    Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized StorageSuccinct Zero-Knowledge Batch Proofs for Set Accumulators

    Eduardo Soria-Vazquez
    Technology Innovation Institute

    Rinocchio: SNARKs for Ring Arithmetic
    Researcher

    Eduardo.Soria-Vazquez@tii.ae

    Emanuele Giunta
    IMDEA

    On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups

    Giulio Malavolta
    Max Planck Institute for Security and Privacy

    RFP-10

    Researcher

    Hamidreza Khoshakhlagh
    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

    Janno Siim

    Impossibilities in Succinct Arguments: Black-box Extraction and More

    Justin Thaler
    Georgetown University

    Advisor

    Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup
    AdvisorResearcher

    Kelsey Melissaris
    Aarhus University

    Witness-Authenticated Key Exchange Revisited: Improved Models, Simpler Constructions, Extensions to Groups

    Leo Reyzin
    Boston University

    Markulf Kohlweiss
    University of Edinburgh

    What Makes Fiat--Shamir zkSNARKs (Updatable SRS) Simulation Extractable?
    Assistant Professor

    mkohlwei@ed.ac.uk

    Mary Maller
    Ethereum Fondation

    SnarkPack: Practical SNARK AggregationCaulk: Lookup Arguments in Sublinear Time

    Mathias Hall-Andersen
    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

    Philipp Jovanovic
    UCL

    Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup
    Assistant Professor

    Sophia Yakoubov
    Aarhus University

    Count Me In! Extendability for Threshold Ring Signatures
    Assistant Professor

    sophia.yakoubov@cs.au.dk

    Youssef El Housni
    Ecole Polytechnique

    PhD Student

    youssef.el-housni@inria.fr

    CryptoNet is a Protocol Labs initiative.