On the computational hardness needed for quantum cryptography

preview_player
Показать описание
Authors: Zvika Brakerski (Weizmann Institute of Science); Ran Canetti, Luowen Qian (Boston University)
ITCS - Innovations in Theoretical Computer Science
  1. Simons Institute
  2. Simons Institute
  3. theoretical computer science
  4. UC Berkeley
  5. Computer Science
  6. Theory of Computation
Рекомендации по теме
On the computational 0:19:38

On the computational hardness needed for quantum cryptography

On the Computational 0:47:55

On the Computational Hardness Needed for Quantum Cryptography

Igor Carboni Oliveira: 0:30:41

Igor Carboni Oliveira: Extracting Computational Hardness from Learning Algorithms

Computational hardness assumption 0:03:06

Computational hardness assumption

Hardness - Intro 0:01:35

Hardness - Intro to Theoretical Computer Science

On the cryptographic 1:03:50

On the cryptographic hardness of finding a Nash equilibrium - Nir Bitansky

NP-hardness 0:03:06

NP-hardness

P and NP 0:02:03

P and NP - Georgia Tech - Computability, Complexity, Theory: Complexity

The Biggest Problem 0:00:49

The Biggest Problem in Cryptography ⚠️ #short

Self-testing of a 0:22:53

Self-testing of a single quantum device under computational assumptions

P vs. NP 0:10:44

P vs. NP and the Computational Complexity Zoo

Rafael Pass - 0:40:21

Rafael Pass - Cryptography from Sublinear Hardness of Time-Bounded Kolmogorov Complexity

Joan Bruna: 'On 0:55:31

Joan Bruna: 'On Computational Hardness with Graph Neural Networks'

Hemanta Maji: Computational 0:51:38

Hemanta Maji: Computational Hardness of Optimal Fair Computation

On Hardness Assumptions 0:45:52

On Hardness Assumptions Needed for ``Extreme High-End'' PRGs and Fast Derandomization

Getting Harder All 0:17:31

Getting Harder All the Time?

Nearly Optimal Pseudorandomness 0:26:03

Nearly Optimal Pseudorandomness From Hardness

Cryptography from Sublinear-Time 0:46:10

Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity

FOCS 2024 7B 0:16:49

FOCS 2024 7B Computational hardness of detecting graph lifts and certifying lift-monotone...

Convex Relaxations in 0:19:39

Convex Relaxations in Power System Optimization: Computational Hardness (4 of 8)

Black-Hole Radiation Decoding 0:47:20

Black-Hole Radiation Decoding as a Cryptographic Assumption

Hardness Assumptions Beyond 0:06:38

Hardness Assumptions Beyond NP ≠ P || @ CMU || Lecture 26a of CS Theory Toolkit

Game Theory 2 0:05:13

Game Theory 2 04a Hardness of Computing a Nash Equilibrium Basic

QIP2021 | Device-independent 0:29:54

QIP2021 | Device-independent protocols from computational assumptions (Tony Metger)