Cover Image for Real World Cryptography Paris Meetup 1
Cover Image for Real World Cryptography Paris Meetup 1
75 Went

Real World Cryptography Paris Meetup 1

Hosted by Nadim Kobeissi, Sylve & Yehor Balytskyi
Registration
Past Event
Please click on the button below to join the waitlist. You will be notified if additional spots become available.
About Event

Welcome to the Real World Cryptography Paris (RWC Paris) Meetups! Our goal is to bring together enthusiasts, professionals, and academics to discuss the latest advancements in cryptography. Whether you're an experienced cryptographer, a software engineer, or someone with a keen interest in the field, our meetups offer a platform to learn, share, and network.

Join us for an evening of insightful talks, discussions, and networking. Light refreshments will be provided.

More info on the website: https://cryptography.paris

Meetup 1 Schedule

​The schedule for the meetup is as follows:

​18:00 - Announcements

Welcome announcements and a short blurb about the event.

​18:10 - "Hijacking Electronic Passports for Anonymous Proofs of Humanity" by Florent Tavernier and Rémi Colin, Proof of Passport

Proof of humanity is a hard problem. By using existing attestations like passports, we can let users create privacy preserving proofs of identity that can be used for a wide range of applications.

​18:35 - "Ethical Identity, Ring VRFs, and Zero-Knowledge Continuations" by Jeff Burdges, Web3 Foundation

Anonymized ring VRFs are ring signatures that prove correct evaluation of some authorized signer’s PRF while hiding the specific signer’s identity within some set of possible signers, known as the ring. We propose ring VRFs as a natural fulcrum around which a diverse array of zkSNARK circuits turn, making them an ideal target for optimization and eventually standards.

We explain how rerandomizable Groth16 zkSNARKs transform into reusable zero-knowledge continuations, and build a ring VRF that amortizes expensive ring membership proofs across many ring VRF signatures. In fact, our ring VRF needs only eight G_1 and two G_2 scalar multiplications, making it the only ring signature with performance competitive with constructions like group signatures.

Ring VRFs produce a unique identity for any give context but which remain unlinkable between different contexts. These unlinkable but unique pseudonyms provide a far better balance between user privacy and service provider or social interests than attribute based credentials like IRMA.

Ring VRFs support anonymously rationing or rate limiting resource consumption with major performance advantages over protocols for private monetary transactions.

​19:00 - "Secure One-Round Biometric Authentication under Encryption" by Valentin Reyes Häusler, Carl von Ossietzky Universität Oldenburg

Biometric verification protocols provide reliable and easy-to-use authentication methods, security of which can be adjusted according to the security requirements of the application setting. Securing the underlying biometric data is imperative due to its highly sensitive nature. Stolen biometric traits are nearly impossible to revoke due to their persistance throughout a person's life, and possibly even beyond via biometric trait inheritance.

We propose a secure single-round biometric authentication scheme by leveraging the properties of the TFHE scheme. Our protocol is secure in the malicious setting of both the authenticating and verifying party. It improves on the current state-of-the-art by reducing the number of rounds from at least 4 to only one while accomplishing practicable runtimes for some use cases.

This talk gives an overview over the current protocol, its implementation, as well as current benchmarks. The goal of this talk is to foster an interesting and productive discussion on possible improvements, speed-ups and additional applications.

​19:15 - "A ZK-Friendly Arithmetization of Keccak" by Azam Soleimanian, Consensys

Due to bitwise operations, proving Keccak in the circuit is pretty inefficient. We present an arithmetization of Keccak that computes Keccak and gives the same output, but it is zk-friendly and more efficient to prove.

​19:35 - Food & Drinks (Sponsored by Hylé and Symbolic Software)

Yum yum! Our incredible sponsors provide you with things that you can eat while you talk to each other, hopefully not at exactly the same time.

​21:00 - Closing

​Our Incredible Sponsors

​We would like to express our gratitude to our sponsors, Zama, Hylé and Symbolic Software, for their support in making this meetup possible and providing refreshments for our attendees.

​About Zama

Zama is an open source cryptography company building state-of-the-art Fully Homomorphic Encryption (FHE) solutions for blockchain and AI.

​About Hylé

Hylé is your minimal layer one, focused only on verifying zero-knowledge proofs. By sending a simple proof to be verified on Hylé, you can build a fully off-chain application powered by ZKPs that still has the security guarantees of the blockchain.

​About Symbolic Software

Symbolic Software is an applied cryptography outfit based in Paris that champions global digital security through extensive services, including security audits, cryptographic protocol design, and formal verification. We pride ourselves on delivering over 250 comprehensive software and cryptographic audits for clients worldwide and advancing the field of applied cryptography with our research software.

Stay connected

Stay up to date with our future events and announcements:

Code of conduct

RWC Paris Meetups aims to be a friendly place for people with common interests to meet up and talk about real world cryptography. Everyone who attends promises to:

  • Treat everyone with dignity and respect.

  • Be considerate and understanding of differing viewpoints and experiences.

  • Be respectful in all forms of communication, including in-person and online.

Organizers & sponsors

Organized by Sylve, Yehor and Nadim.

Sponsored by: Zama, Hylé, Symbolic Software

Location
8 Rue du Sentier
75002 Paris, France
Zama office (Building A, Floor 4)
75 Went