RISC Seminars

     Archives: [2019] [2018] [2017] [2016] [2015] [2014] [2013] [2012] [2011] [2010] [2009] [2008] [2007] [2006] [2005] [2004] [List of Speakers]
(To receive information about upcoming seminars, register for the RISC mailing list.)

Upcoming Event(s)


[print]
CWI Lectures on Cryptology

These Lectures are held in honor of *David Chaum* and are organized in connection with the newly established ``Edsger W Dijstra Fellowship'' that will be bestowed on David Chaum by CWI the day before. His Award is in recognition of his seminal research in cryptology, its societal significance, and his contributions, dating back to his time at CWI from the early 1980s to the late 1990s, to the establishment of a Dutch, and more generally, European, academic research community in the field.

Date:November 22, 2019
Location:CWI, Turing Room
Schedule: 
11:45 - 12:30Registration and buffet lunch
12:30 - 12:40Welcome
12:40 - 13:25Claude Crépeau (McGill University, Canada):
Demonstrating That a Public Graph Can Be 3-Coloured Without Revealing Any Knowledge About How...
Abstract: In this talk, we review the early days of Interactive Proofs, Interactive Arguments and other Zero-Knowledge protocols. We highlight Chaum’s contributions to this young (30 years ago) field and where it led us today. We survey current research on Argument Systems, as well as Zero-Knowledge proofs where soundness and zero-knowledge only rest on the assumption that no information can travel faster than the speed of light.
13:25 - 14:10Serge Fehr (CWI & Leiden University):
Multiparty Computation: Collaborate without Compromise(ing Your Data)
Abstract: Multiparty computation (MPC) provides cryptographic means that enable mutually distrustful parties to collaborate in a secure way, ensuring that individual data used for the collaboration remains private. The theoretical foundations of MPC were set in the early eighties in a sequence of pioneering work that showed general possibility results. Since then, MPC has remained a lively research topic but was long considered to be of theoretical interest only due to its large computational overhead. However, thanks to the continuous efforts in making MPC more efficient, it is now at the verge of being practically relevant and is gradually starting to experience real world deployment. In this presentation, I explain the general goal of MPC, give some details on how it can be achieved, and discuss some potential and actual real-world applications.
14:10 - 14:40Break
14:40 - 15:25Gilles Brassard (University of Montreal, Canada):
Big Brother in a Quantum World
Abstract: Although practised as an art and science for ages, cryptography had to wait until the mid-twentieth century before Claude Shannon gave it a strong mathematical foundation. However, Shannon's approach was rooted in his own information theory, itself inspired by the classical physics of Newton and Einstein. When quantum theory is taken into account, new vistas open up both for codemakers and codebreakers. Is this a blessing or a curse for the protection of privacy and the fight against Big Brother so central to David's mission? As we shall see, the jury is still out! (No prior knowledge in quantum theory will be assumed)
15:25 - 16:10Anna Lysyanskaya (Brown University, USA):
1984 without Big Brother: Anonymous Credential Systems and Variations
Abstract: In 1984, David Chaum wrote: "Today, individuals provide substantially the same identifying information to each organization with which they have a relationship. In a new [better] paradigm, individuals [should] provide different "pseudonyms" or alternate names to each organization. A critical advantage of systems based on such pseudonyms is that the information associated with each pseudonym can be insufficient to allow data on an individual to be linked and collected together, and thus they can prevent the formation of a dossier society reminiscent of Orwell's "1984"." Thirty five years later, this vision is as relevant as ever. Luckily, we also have as many years of developments of cryptographic approaches to the 1984 problem. In this talk, I will go over these approaches, from anonymous credentials, to anonymous electronic cash and untraceable e-tokens, to anonymous attestation, and beyond.
16:10 - 16:25Break
16:25 - 17:10David Chaum (Elixxir, USA):
Designing a Metadata Resistant Network
Abstract: TBA
17:10 - 18:30 Closing and drinks

Ahead of the scientific program, a lunch is offered to participants. The program is concluded with a reception. Registration is free but required. The registration link is found here.


Past 2019 Event(s)


October 4, 2019RISC Seminar on Isogeny Based Cryptography
  • Lorenz Panny (TU Eindhoven, The Netherlands): What are isogenies and why do we care?
  • Luca De Feo (IBM Research - Zurich, Switzerland): How to prove a secret isogeny
  • Wouter Castryck (KU Leuven, Belgium): Isogeny-based cryptography in genus 2
June 27, 2019RISC Seminar on Blockchain
  • Esteban Landerreche (CWI): Crypto & Crypto: What blockchains mean to cryptography
  • Eduardo Moraes de Morais (ING): Research problems in Cryptography for Blockchain
  • Juan Garay (Texas A&M University): How to Bypass a Consensus Impossibility Result
  • Giorgos Panagiotakos (University of Edinburgh): Iterated Search Problems and Blockchain Security under Falsifiable Assumptions
May 17RISC Seminar
  • Prof. Aggelos Kiayias (University of Edinburgh & IOHK): Architecting Secure and Efficient Distributed Ledgers
May 3, 2019RISC + Prometheus Seminar
  • Thomas Prest (PQ-Shield): All Along the Ring Tower: Algebraic Structures for Fun and Profit
  • Serge Fehr (CWI, Amsterdam): Security of the Fiat-Shamir Transformation in the Quantum Random Oracle Model
  • Thijs Laarhoven (TU Eindhoven): Lattice algorithms for the closest vector problem with preprocessing
  • Alice Pellet--Mary (ENS Lyon): Approx-SVP in Ideal Lattices with Pre-processing and (maybe) some extensions
March 18, 2019Special RISC Seminar on the Occasion of Max Fillinger's PhD Defense
  • Max Fillinger (Fox-IT, formerly CWI): Two-Prover Bit-Commitments: Classical, Quantum and Non-Signaling
  • Stacey Jeffery (CWI and QuSoft): On Non-Adaptive Quantum Chosen-Ciphertext Attacks and Learning With Errors
  • Stefan Wolf (Università della Svizzera italiana): Causality - Consistency - Complexity
0.00345s c