🤼

About

CryptoNet is a community of researchers and engineers working on designing, proving, improving the building blocks for crypto-networks to engender new capabilities across the Web 3.0 stack.

The group was founded to drive the creation of Filecoin, but it seeks to facilitate the development and incorporation of cryptographic tools to increase security and privacy of communication more broadly.

Cryptonet is a Protocol Labs, Inc. initiative.

Research Endeavours

Cryptography: Filecoin and other Web 3.0 technologies rely on the performance and security of cryptographic primitives. Our endeavours include: Proof of Replication, Proof of SpaceTime, SNARKs, Vector Commitments, Verifiable Delay Functions, Verifiable Databases, Threshold Cryptography.
Blockchain: We are working to advance the state of the art of generic blockchain constructions.
Web 3.0: Our projects contribute improvements to the application layer of the Filecoin protocol and its components, including mining, repair, security, and storage. These improvements may be generalized to other Web 3.0 technologies.

Members

irenegia

Researcher

lucaniz

Researcher

ninitrava

Researcher

rosario.gennaro

Researcher

matteo

Researcher

kubuxu

Protocol Engineer

anorth

Protocol Engineer

iamnotnicola

Team Lead

Community

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 Time Linear-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 Arithmetic ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines Impossibilities 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 Engines Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers Structure-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 Groups Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage Subversion-resilient enhanced privacy ID Succinct Zero-Knowledge Batch Proofs for Set Accumulators Witness Encryption for Succinct Functional Commitments and Applications	ProfessorAdvisor
Dimitris Kolonelos	IMDEA		Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage Succinct 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) Committees Impossibilities in Succinct Arguments: Black-box Extraction and More Witness 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 Aggregation Caulk: Lookup Arguments in Sublinear Time
Mathias Hall-Andersen	Aarhus University		Count Me In! Extendability for Threshold Ring Signatures Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions Curve 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

📖Research Enablers Group

🔮Protocol Opportunities Group

Video

Communication Channels

Filecoin Slack: #fil-protocol - channel ID: C04USV0L7PF
Want to contribute? Reach out via our Discord server! https://discord.gg/BsU96Eh3fY