Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer.

Slides:

Advertisements

Similar presentations

Quantum Cryptography Nick Papanikolaou Third Year CSE Student

Advertisements

1 Introduction to Quantum Computation and Quantum Information Dr. Raja Nagarajan University of Warwick.

Lecture 8: Coin Flipping by Telephone Wayne Patterson SYCS 654 Spring 2010.

QCRYPT 2011, Zurich, September 2011 Lluis Masanes 1, Stefano Pironio 2 and Antonio Acín 1,3 1 ICFO-Institut de Ciencies Fotoniques, Barcelona 2 Université.

Foundations of Cryptography Lecture 7 Lecturer:Danny Harnik.

Rennes, 23/10/2014 Cristina Onete Commitment Schemes and Identification/Authentication.

Yan Huang, David Evans, Jonathan Katz

1 Reducing Complexity Assumptions for Statistically-Hiding Commitment Iftach Haitner Omer Horviz Jonathan Katz Chiu-Yuen Koo Ruggero Morselli Ronen Shaltiel.

Intro to Quantum Cryptography Algorithms Andrew Hamel EECS 598 Quantum Computing FALL 2001.

Implementation of Practically Secure Quantum Bit Commitment Protocol Ariel Danan School of Physics Tel Aviv University September 2008.

Polling With Physical Envelopes A Rigorous Analysis of a Human–Centric Protocol Tal Moran Joint work with Moni Naor.

Christian Schaffner CWI Amsterdam, Netherlands Position-Based Quantum Cryptography: Impossibility and Constructions Seminar Eindhoven, Netherlands Wednesday,

Csci5233 Computer Security1 Bishop: Chapter 10 (Cont.) Key Management: Certificates.

Rennes, 23/10/2014 Cristina Onete Commitment Schemes and Identification/Authentication.

Position-Based Quantum Cryptography Christian Schaffner ILLC, University of Amsterdam Centrum Wiskunde & Informatica Logic Tea, ILLC Tuesday, 14/02/2012.

On Fair Exchange, Fair Coins and Fair Sampling Shashank Agrawal, Manoj Prabhakaran University of Illinois at Urbana-Champaign.

Computational Security. Overview Goal: Obtain computational security against an active adversary. Hope: under a reasonable cryptographic assumption, obtain.

Eran Omri, Bar-Ilan University Joint work with Amos Beimel and Ilan Orlov, BGU Ilan Orlov…!??!!

Experimental Bit String Generation Serge Massar Université Libre de Bruxelles.

Short course on quantum computing Andris Ambainis University of Latvia.

Some Limits on Non-Local Randomness Expansion Matt Coudron and Henry Yuen /12/12 God does not play dice. --Albert Einstein Einstein, stop telling.

Quantum Cryptography Qingqing Yuan. Outline No-Cloning Theorem BB84 Cryptography Protocol Quantum Digital Signature.

Oblivious Transfer based on the McEliece Assumptions

Stanford vs. UC: The Big Game A. Datta, A. Derek, J. C. Mitchell, A. Ramanathan & A. Scedrov August 16, 2005.

On Everlasting Security in the Hybrid Bounded Storage Model Danny Harnik Moni Naor.

K-Anonymous Message Transmission Luis von Ahn Andrew Bortz Nick Hopper The Aladdin Center Carnegie Mellon University.

EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.

Protocols to do seemingly impossible 1 CHAPTER 11: Protocols to do seemingly impossible A protocol is an algorithm two (or more) parties have to follow.

Feynman Festival, Olomouc, June 2009 Antonio Acín N. Brunner, N. Gisin, Ll. Masanes, S. Massar, M. Navascués, S. Pironio, V. Scarani Quantum correlations.

Christian Schaffner CWI Amsterdam, Netherlands Quantum Cryptography beyond Key Distribution Workshop on Post-Quantum Security Models Paris, France Tuesday,

1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 19 (2009)

Introduction1-1 Data Communications and Computer Networks Chapter 6 CS 3830 Lecture 31 Omar Meqdadi Department of Computer Science and Software Engineering.

1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.

Device-independent security in quantum key distribution Lluis Masanes ICFO-The Institute of Photonic Sciences arXiv:

Modern Cryptographic Topics

Introduction to Modern Cryptography Sharif University Spring 2015 Data and Network Security Lab Sharif University of Technology Department of Computer.

Cryptography In the Bounded Quantum-Storage Model Christian Schaffner, BRICS University of Århus, Denmark ECRYPT Autumn School, Bertinoro Wednesday, October.

Cryptography In the Bounded Quantum-Storage Model Christian Schaffner, BRICS University of Århus, Denmark 9 th workshop on QIP 2006, Paris Tuesday, January.

1 A Randomized Space-Time Transmission Scheme for Secret-Key Agreement Xiaohua (Edward) Li 1, Mo Chen 1 and E. Paul Ratazzi 2 1 Department of Electrical.

Quantum Cryptography Christian Schaffner Institute for Logic, Language and Computation (ILLC) University of Amsterdam Centrum Wiskunde & Informatica Amsterdam.

Quantum Teleportation and Bit Commitment Chi-Yee Cheung Chung Yuan Christian University June 9, 2009.

Practical Aspects of Quantum Coin Flipping Anna Pappa Presentation at ACAC 2012.

On the Communication Complexity of SFE with Long Output Daniel Wichs (Northeastern) joint work with Pavel Hubáček.

A limit on nonlocality in any world in which communication complexity is not trivial IFT6195 Alain Tapp.

Introduction to Quantum Key Distribution

Entanglement sampling and applications Omar Fawzi (ETH Zürich) Joint work with Frédéric Dupuis (Aarhus University) and Stephanie Wehner (CQT, Singapore)

Christian Schaffner CWI Amsterdam, Netherlands Quantum Cryptography beyond Key Distribution Tropical QKD Waterloo, ON, Canada Wednesday, 16 June 2010.

Cryptography In the Bounded Quantum-Storage Model

Feasibility and Completeness of Cryptographic Tasks in the Quantum World Hong-Sheng Zhou (U. Maryland) Joint work with Jonathan Katz (U. Maryland) Fang.

Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.

1 Conference key-agreement and secret sharing through noisy GHZ states Kai Chen and Hoi-Kwong Lo Center for Quantum Information and Quantum Control, Dept.

Communication Complexity Guy Feigenblat Based on lecture by Dr. Ely Porat Some slides where adapted from various sources Complexity course Computer science.

Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.

Quantum Cryptography Christian Schaffner

Quantum Cryptography Antonio Acín

Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.

1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.

Ankit Garg Princeton Univ. Joint work with Mark Braverman Young Kun Ko Princeton Univ. Princeton Univ. Jieming Mao Dave Touchette Princeton Univ. Univ.

13. Oktober 2010 | Dr.Marc Fischlin | Kryptosicherheit | 1 From Key Exchange to Secure Channels 21. CROSSING Conference 2015 Marc Fischlin.

Bit Commitment, Fair Coin Flips, and One-Way Accumulators Matt Ashoff 11/9/2004 Cryptographic Protocols.

Cryptography in the Bounded-Quantum-Storage Model Christian Schaffner BRICS, University of Aarhus PhD Defense Friday, April 27 th 2007.

1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.

Zero Knowledge r Two parties:  All powerful prover P  Polynomially bounded verifier V r P wants to prove a statement to V with the following properties:

Topic 36: Zero-Knowledge Proofs

Homomorphic encryption of quantum data

Information primitives and laws of nature Mai 2008 Alain Tapp

CV Cryptography Using a Bidirectional Quantum Channel

Quantum Cryptography Christian Schaffner

On the Power of Hybrid Networks in Multi-Party Computation

Quantum-security of commitment schemes and hash functions

Presentation transcript:

Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science Quantum Bit Commitment Christian Schaffner DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science NAT-årsfest June 3, 2005

Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science Alice & Bob Alice Bob *!¤

Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science Alice Bob who gets the house? *!¤ Divorce Problems

Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science Coin-Flipping over the Telephone It’s tails, I get the house! Alice Bob

Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science A Coin-Flipping Protocol Alice Bob not random!

Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science The Solution Alice Bob

Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science The Explanation Alice Bob

Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science Bob‘s view Bit-Commitment Scheme Alice Bob commit open important cryptographic primitive hiding binding

Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science Bob‘s view Particular Bit-Commitment Scheme open honest Alice needs:n cheating Alice needs:2¢n Memory cheater < 2 ¢ Memory honest ) binding perfectly hiding Alice Bob commit to 0 commit to 1 bounded memory! (n MegaBytes) (n MB)

Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science open Alice Bob Bob‘s view n quantum bits perfectly hiding honest Alice needs no quantum memory Memory cheater < n/2 ) binding bounded quantum memory! measure qbits in basis a bounded memory! classically: Memory cheater < 2 ¢ Mem honest Quantum Bit-Commitment Scheme

Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science The End Alice bounded quantum memory! Bob bounded quantum memory! *!¤

Christian Schaffner, PhD student NF-årsfest 2005 A A R H U S U N I V E R S I T E T DAIMI – Department of Computer Science BRICS – Basic Research in Computer Science Classically Impossible perfectly secure, without assumptions with classical communication with quantum communication Alice Bob Bob‘s view open commit hiding binding bounded memory!