• ZK-TLV 0x09: all you can eat BFT

    Facebook

    For our ninth ZK-TLV event, on Monday, November 11th, we bring Ittai Abraham from VMware research to give a full overview on EVERYTHING related to modern distributed consensus systems. This time the event will include a lecture in two parts followed by a Q&A (and the usual mingling in between): ----------------------------------- Schedule: - 6.00pm: greetings, food and drinks - 6.30pm: Bitcoin, Blockchain, BFT and Beyond Part 1 - 7.00pm: break - 7.15pm: Bitcoin, Blockchain, BFT and Beyond Part 2 ----------------------------------- Abstract: In the first part we will discuss the connections between Bitcoin and Blockchain and the field of Fault tolerance and Byzantine Agreement. In the second part we will discuss PBFT, SBFT, Tendermint, Casper and HotStuff and present a simple Byzantine Fault Tolerant State Machine Replica Protocol. ----------------------------------- Ittai Abraham (@ittaia) is a researcher at VMware research. He does research on algorithms and distributed computing. ----------------------------------- Join the discussion and get the slides on the zero knowledge facebook group: https://www.facebook.com/groups/ZeroKnowledge/ ----------------------------------- The event is sponsored jointly by Beam.mw (https://www.beam.mw/) and Qedit(https://qed-it.com/) . Special thanks to Facebook for hosting! ---------------------------------- Did you know: we are hosting a 1day zk workshop on October 24th: https://zkworkshop.splashthat.com/

    3
  • ZK-TLV 0x08: on Confidential Smart Contracts and VDF in Ethereum 2.0

    For our eight and Blockchain Week special Zero Knowledge event, on September 12th, we are pleased to host two world renowned speakers: Oleg Andreev, protocol architect at Stellar and author of ZkVM and Justin Drake, Ethereum 2.0 researcher leading some of the efforts around VDF. We will be talking about ZkVM, a novel blockchain design, allowing for scalable confidential smart contracts and Verifiable Delay Function, one of the fundamental concept behind Ethereum 2.0. Schedule: - 6.30pm: greetings, food and drinks - 7.15pm: Oleg Andreev will present ZkVM, a novel design for a multi-asset blockchain, that enables scalable confidential smart contracts - 8pm: Justin Drake will give a talk on RSA Verifiable Delay Functions and its implications for Ethereum 2.0 The event will finish at 9.30pm. Talks will be given in English. ----------------------------------- For more details, here the abstracts and bios of our speakers: ZkVM is a novel design for a multi-asset blockchain, that enables scalable confidential smart contracts. ZkVM elegantly combines some of the best ideas in the industry in a unified architecture. Transactions are Turing-incomplete programs that perform operations on financial Values and satisfy smart contract conditions. Smart contracts operate on encrypted data. While VM executes a transaction, it assembles all smart contract conditions into a Bulletproofs constraint system on the fly, and, in the end, verifies it with a single proof. Transaction effects are limited to deletion and insertion of unspent outputs (UTXOs); this enables fully parallelized verification and a very compact state via the Utreexo scheme. As a result, ZkVM blockchain is fast, scalable and simple, preserves confidentiality of the data and assets, and enables complex high-level protocols (such as decentralized order books and payment channels). Oleg Andreev is a software engineer and protocol architect at Stellar. With past background in UI design, Oleg focuses on making complex cryptography practical and easy to use. Oleg is author of Gitbox version control app, CoreBitcoin and BTCRuby libraries, co-author of Dalek Bulletproofs implementation. ------------ RSA Verifiable Delay Functions A Verifiable Delay Function (VDF) is a cryptographic primitive tied to physical time through sequential computation. The properties of VDFs make them especially promising for blockchains, e.g. as a tool to generate unbiasable randomness. This talk will focus on RSA-based VDFs which are being pursued by a consortium of blockchain foundations known as the VDF Alliance. Justin studied mathematics at Cambridge University. He was a Bitcoin entrepreneur from 2014 to 2017 and is now an Ethereum 2.0 researcher. ------------ Join the discussion and get the slides on the zero knowledge facebook group: https://www.facebook.com/groups/800441673459620/ The event is sponsored jointly by Beam.mw (https://www.beam.mw/), Qedit(https://qed-it.com/) and Samsung Next

  • ZK-TLV 0x07 - On the Discrete Log Problem and Distributed Verifiers in ZKP

    For our seventh Zero Knowledge event, on July 15th, we are pleased to host two great speakers: Idan Perl and Eylon Yogev. The event takes place again at Rise, Ahad Ha'Am St 54, Tel Aviv-Yafo, Israel. We will be talking about the fundamentals of cryptography, aka the Discret Logarithm problem and distributed verification settings for ZKP. Schedule: - 6.30pm: greetings, food and drinks - 7pm: Idan will talk about the Discrete Logarithm problem and dive into its hardness - 7.45pm: Eylon will explore the power of interactive proofs with a distributed verifier The event will finish at 9pm. Talks will be given in English. ----------------------------------- For more details, here the abstracts and bios of our speakers: The Discrete Logarithm Problem Abstract: The Discrete Logarithm problem (DLP) lies in the heart of many crypto system, including but not limited to Zero Knowledge Proofs. In this talk we will present the problem and discuss a few of the best known algorithms to solve it - or if you are in a crypto kind of mood - attack it. A basic familiarity with group theory will be assumed. Idan is Lead Cryptographer at Orbs, a public blockchain infrastructure for businesses looking at trust as a competitive strategy. He works in diverse areas of cryptography. Before joining Orbs, he received his phd in mathematics from Ben Gurion University, working in the field of Geometric Group Theory. ------------ The Power of Distributed Verifiers in Interactive Proofs Abstract: We explore the power of interactive proofs with a distributed verifier. In this setting, the verifier consists of n nodes and a graph G that defines their communication pattern. The prover is a single entity that communicates with all nodes by short messages. The goal is to verify some property of the graph G in a small number of rounds, and with small communication bound, i.e., the proof size. In this work, we provide a new general framework for distributed interactive proofs that allows one to translate standard interactive protocols (i.e., with a centralized verifier) to ones where the verifier is distributed with a proof size that depends on the computational complexity of the verification algorithm run by the centralized verifier. We further demonstrate the power of our compiler for specific problems such as Graph Non-Isomorphism, and Leader Election. Joint work with Merav Parter and Moni Naor. Eylon Yogev is a postdoc at the Technion. Prior to that, he has received his Ph.D. from the Weizmann Institute under the supervision of Prof. Moni Naor. His research focuses on theoretical computer science in general and in particular in cryptography and its interaction with distributed algorithms. ------------ Join the discussion on the zero knowledge facebook group: https://www.facebook.com/groups/800441673459620/ The event is sponsored jointly by QEDIT (https://qed-it.com/)

  • ZK-TLV 0x06 - Between crypto products and crypto fails

    For our sixth Zero Knowledge event, on June 3rd, we are pleased to host two great speakers: Shiri Lemel and Omer Shlomovits, also co-organiser of ZK-TLV. The event takes place at Rise, Ahad Ha'Am St 54, Tel Aviv-Yafo, Israel. We will be talking about turning Zero Knowledge into actual products, discussing use cases, pitfalls and crypto fails in implementing cryptography. Schedule: - 6pm: greetings, food and drinks - 6.30pm: Following QEDIT recent fundraising, Shiri will present how they turn cutting-edge technology into an actual product - 7.15pm: Omer will present pitfalls and major implementation crypto fails, still plaguing the space. The event will finish at 9pm. Talks will be given in English. ----------------------------------- For more details, here the abstracts and bios of our speakers: From technology to business in cryptography Abstract: Taking Zero Knowledge into traditional industries requires an end-to-end overview of the use-case and deep understanding of processes and flows. In this talk we will review use-cases in supply chain management and user consent systems to understand the role of ZKP in enabling digitalisation, and how QEDIT is addressing the needs of these industries in our Asset Transfer solution. Shiri Lemel is the VP Business Development at QEDIT. She has an engineering degree from Tel Aviv University and is an MBA alumni. She was formerly the head of EMEA Tech Sales of the Enterprise Security product Trusteer at IBM. ------------ Cryptographic vulnerabilities in implementing complex cryptography Abstract: Funny and serious talk on all the explosives that needs to be safely defused when implementing cutting edge cryptography. We will use two party ECDSA Bitcoin wallet to show case errors done by engineers and cryptography designers, ranging from bad keys all to way to full zero days based on zero knowledge proof. All found in real world systems. Eventually I will provide some best practices on how to do it right. The talk was accepted to breakingbitcoin.com Omer is a co-founder and scientist at KZen. Omer is working on a variety of applied research questions in the fields of threshold cryptography and distributed systems. ------------ Join the discussion on the zero knowledge facebook group: https://www.facebook.com/groups/800441673459620/ The event is sponsored jointly by QEDIT (https://qed-it.com/)

  • ZK-TLV 0x05: on Homomorphic Encryption and SGX

    Microsoft Reactor Tel Aviv

    For our fifth Zero-knowledge meetup, we are pleased to welcome you at Microsoft Reactor, Dubnov St 7, Tel Aviv-Yafo, on April, 1st. This Chapter will include two new topics, given by three fabulous speakers : * Introduction to homomorphic encryption (HE: https://en.wikipedia.org/wiki/Homomorphic_encryption) given by Max Leibovich who is researching FHE as part of his Ph.D at Haifa U. * How Enigma (https://enigma.co/) is using Intel's SGX as part of a system to get privacy in smart contracts. Talk will be given by Isan Rivkin and Moria Abadi, software engineers working at Enigma. ----------------------------------- Schedule: - 6.00pm: greetings, food and drinks - 6.30pm: * SGX as Driver for Privacy in the Decentralised Web // Moria & Isan * The wonderful world of HE // Max Talks will be given in English. For more details, here the abstracts and bios of our speakers: ----------------------------------- Title: The wonderful world of HE Advancements in cryptography in the last few decades introduced several novel tools that allow Alice (client) to encrypt the data in her possession, pass the ciphertexts to Bob (server) and ask Bob to compute any function of her choosing on these ciphertexts, without disclosing any information about her data. One such tool is Fully Homomorphic Encryption (FHE). To get a small taste on how FHE works and how it's even possible to compute on ciphertexts we will see a toy Homomorphic Encryption scheme over the Integers. Next, we will have a bird's-eye view on several techniques that make FHE schemes faster and mention several state-of-the-art implementations. Max is a multidisciplinary software developer with about 10 years of experience in many different technologies and a curious and enthusiastic academic. Nowadays he is working towards a Ph.D. at Haifa University under the guidance of Dr. Adi Akavia. ------------ Title: SGX as Driver for Privacy in the Decentralised Web The talk will cover SGX as a security solution for decentralised networks and how the Enigma protocol utilizes its functionality together with Ethereum to create a safe environment for private contracts Moria is software engineer at Enigma, previously at IBM research. Moria has developed the WASM engine and framework for Enigma secret contracts Isan is a software engineer at Enigma, designing and implementing the P2P network side and SGX related features. Join the discussion on the zero knowledge facebook group: https://www.facebook.com/groups/800441673459620/ We thank Enigma for sponsoring the event.

  • ZK-TLV 0x04: on pairings and blockchain privacy

    Google for Startups Campus

    For our fourth Zero-knowledge meetup, we are delighted to welcome you at Google for Startups Campus Israel, Ha-Umanim St 12, Tel Aviv-Yafo, on February, 18th. This Chapter will feature two privacy researchers, one from Industry and one from Academy! Ariel Gabizon, a known practitioner of zk-snarks will help us explore some basic math tools and why they have a crucial role in making privacy apps like Zcash practical. Afterwards, We will have Professor Claudio Orlandi give us easy access to the fascinating world of privacy in blockchains, including all the recent results. The event is sponsored by the Zcash Foundation. We thank them deeply! ----------------------------------- Schedule: - 6.30pm: greetings, food and drinks - 7.00pm: * Pairings of Elliptic Curves and their role in constructing zk-SNARKs by Ariel Gabizon * Privacy in Blockchains by Professor Claudio Orlandi Talks will be given in English. For more details, here the abstracts and bios of our speakers: ----------------------------------- Title: Pairings of Elliptic Curves and their role in constructing zk-SNARKs Pairings of elliptic curves are a deep mathematical tool responsible for a lot of the magic in zk-SNARKs. We will explain their role in making SNARKs practical and take a historical math detour all the way back to Riemann to see the original context in which they were developed. For most of his career, Ariel has focused exclusively on theoretical computer science, obtaining a PhD from the Weizmann Institute in 2008. A few years ago he discovered the world of bitcoin and blockchain technology, and sees it as a fascinating potential meeting place of beautiful theoretical computer science ideas and real-world applications. Motivated by this, he shifted his focus in 2014 from pure theory into making tools such as Zero-Knowledge proofs more practical and efficient. Notably, he contributed to the original deployment of Zcash and the more recent Sapling upgrade ------------ Title: Privacy in Blockchains The distributed nature of blockchains means that data is replicated and available in multiple copies over the network. This is clearly problematic from a privacy point of view, especially when the data stored on the blockchain is of confidential nature, such as financial transactions in cryptocurrencies. In this talk I will give a high level overview of some recent research projects which address privacy in blockchain technology, with a focus on the cryptographic components. Some of the results covered in the talk are available on the Cryptology ePrint Archive, Reports 2018/990 and 2018/1105. Originally from Florence, Italy, Claudio is an Associate Professor at Aarhus University, Denmark on Cryptography, MPC, Zero-Knowledge and Blockchain. Join the discussion on the zero knowledge facebook group: https://www.facebook.com/groups/800441673459620/

    2
  • ZK-TLV 0x03: on privacy in Machine Learning and MimbleWimble

    For our third Zero Knowledge event, on January 23th, we are pleased to host two great speakers: Vladislav Gelfer and a special guest coming directly from NeurIPS, Morten Dahl. We will be talking about Cryptographic Private Machine Learning and Privacy on Blockchain. Schedule: - 6.30pm: greetings, food and drinks - 7pm: Vladislav Gelfer will present MimbleWimble high level concepts and existing implementations. - 7.30pm: Morten Dahl will give a talk on Privacy Technologies for Machine Learning The event will finish at 8.30pm. Talks will be given in English. ----------------------------------- For more details, here the abstracts and bios of our speakers: In this talk we focus on recent applications of advanced cryptographic methods to machine learning, in particular deep learning. After illustrating how tools such as homomorphic encryption and multi-party computation can benefit the machine learning process in terms of privacy and trust, we proceed to give a high-level overview of their underlying principles in order to understand differences, weaknesses, and strengths. As an example we show how a model can be trained on data that remain encrypted throughout the whole process. We do so using tf-encrypted, a library on top of TensorFlow for working with encrypted data. Morten holds a PhD in cryptography and works in the intersection of privacy and machine learning. He is interested in practical tools and concrete applications, with a current focus on making advanced privacy-enhancing tools more accessible to practitioners. He is a recurrent speaker in the field and active in community building. ------------ MimbleWimble is a very capable protocol, which, after being published by an anonymous cryptographer 2 years ago, drew a lot of attention. In this talk I'd like to discuss MimbleWimble in-depth, argue why it's a sane payment system and how capable it is, and what can be built on top of it. With all that said, to build a truly anonymous payment system there are many important design decisions, and challenges are yet to be solved. Vladislav Gelfer is lead core developer at Beam (https://www.beam.mw/) ------------ Join the discussion on the zero knowledge facebook group: https://www.facebook.com/groups/800441673459620/ The event is sponsored jointly by KZen (https://github.com/KZen-networks) and Samsung Next

    9
  • ZK-TLV 0x02: On MPC and zk-SNARKs

    MINDSPACE 5th Floor - RISE Tel Aviv

    For our second Zero-knowledge meetup, we are delighted to welcome you at Rise Tel Aviv, at MindSpace, 54 Ahad Ha'Am St. Schedule: - 6.30pm: greetings, food and drinks - 7pm: Carsten Baum will present the basics of Multi Party Computation. This presentation is suitable for beginners and will go into an overview of the subject - 7.30pm: Daniel Benarroch will give a talk on Universal Circuits and how they can be applied to pains in zkSNARKs applications. The event will finish at 8.30pm. Talks will be given in English. ----------------------------------- For more details, here the abstracts and bios of our speakers: Secure Computation is an active and thriving area of cryptographic research. The aim is to design protocols that run algorithms on data which is kept secret. One possible and increasingly popular approach is called Secure Multiparty Computation (MPC). In MPC, the goal is to distribute a computation to multiple participants, who perform such a computation while tolerating arbitrary attacks by participants. In this talk, I will give an introduction to MPC and explain some interesting recent developments of it with respect to Distributed Ledgers. Carsten is a Postdoctoral Researcher at the Bar Ilan Center for Research in Applied Cryptography and Cyber Security. He works in diverse areas such as Security for Machine Learning, Post-quantum Cryptography and Secure Computation. When not working on his academic career, Carsten can mostly be found traveling or looking for the best Hummus in Israel. ------------ Universal Circuits (UC), are programmable circuits that can simulate any circuit up to a fixed size of k gates. In fact, one can generate a set of control bits or programmable bits that allow data to be routed, depending on which circuit one wants to embed. We will talk about the use of arithmetic universal circuits as applied to zkSNARKs. There are several benefits of using universal circuits for SNARK applications, such as one-time trusted setup or circuit privacy, among others. Using UCs is analogous to the specificity of ASICs vs the generality of CPUs - with this work we stand in the middle, comparable to FPGAs. Daniel is the Lead Cryptographer at QED-it, a company building enterprise solutions based on Zero Knowledge Proofs. As part of his job, he is an organizer of ZKProof, an open initiative to standardize the use Zero Knowledge Proofs. He joined QED-it two years ago, after organizing first Bitcoin and Blockchain seminar in the Weizmann Institute, where he got his M.Sc. in Fully Homomorphic Encryption as a student of Zvika Brakerski. Join the discussion on the zero knowledge facebook group: https://www.facebook.com/groups/800441673459620/

    4
  • ZK-TLV 0x01: On ECC and zk-STARKs

    Microsoft ScaleUp (Accelerator)

    For our first Zero-knowledge meetup, we are very excited to greet you at Microsoft ScaleUp, at WeWork, 4 Shaul HaMelech. Schedule: - 6.30pm: greetings and small snacks - 7pm: Tal Be'ery will present the basics of Elliptic Curve cryptography. This presentation is suitable for beginners and will go into an overview of the subject - 7.30pm: Michael Riabzev will give a talk on ZK-STARKs, the newest invention on verifiable computation and zero-knowledge proofs. The event will finish at 8.30pm. Talks will be given in English. ----------------------------------- For more details, here the abstracts and biographies of our speakers: Elliptic Curve Cryptography (ECC) protects many relevant everyday technologies, including the SSL/TLS protocol that protects our Internet communications and ECDSA signatures that protect Bitcoin and Ethereum transactions against modifications. In this talk we will learn about ECC cryptography, using the Billiards game analogy which make ECC understandable even for non-experts. We will describe some attacks against flawed ECC and signatures implementations, including the recent BlueTooth pairing vulnerability discovered by Technion researchers recently. Tal Be'ery is a Co-Founder of KZen Networks, securing crypto assets. Tal is a cyber-security researcher, returning speaker in the industry's most prestigious events, including Black Hat and RSA Conference, member of the Facebook's exclusive WhiteHat list. One of his most known works was the TIME attack against the HTTPS/SSL protocol. For the last 15 years, Tal had built and lead a few Cyber-Security R&D teams, mostly in the field of network monitoring for various security problems and protocols. Previously, Tal has led research for Aorato (acquired by Microsoft) as VP for Research. Tal holds M.Sc. and B.Sc degrees in CS/EE from Tel-Aviv University and a CISSP certification. ------------ zk-STARK is a zero knowledge (zk) protocol that has two main advantages: 1) transparency: no need for a trusted setup; 2) scalability: the time needed to verify a zk-STARK proof is exponentially smaller than the time needed to verify the claim directly. For example, if one could generate a zk-STARK proof for the validity of Bitcoin's blockchain (from the Genesis block to the very latest block), verifying this proof would take only a few milliseconds. In this talk, we will give an overview of the zk-STARK construction and compare it to other recent zk systems (including Aurora, BulletProofs and zkSNARKs). Michael Riabzev is a Co-Founder and Chief Architect of StarkWare Industries and a Ph.D. candidate in the Department of Computer Science at Technion - Israel Institute of Technology. Michael is passionate about the theory, implementation, and applications of transparent and scalable zero knowledge systems, with a focus on use cases within blockchains.

    2