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

Munich Center for Quantum Science & Technology

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

4 years ago - 29:54

Panel Discussion: Computational Assumptions

Simons Institute

Panel Discussion: Computational Assumptions

Streamed 4 years ago - 49:29

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

Ryan O'Donnell

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

4 years ago - 6:38

Assumptions in Cryptography: How Do Cryptographers Sleep Well? | Mohammad Mahmoody | TEDxUVA

TEDx Talks

Assumptions in Cryptography: How Do Cryptographers Sleep Well? | Mohammad Mahmoody | TEDxUVA

10 years ago - 20:45

Communication Complexity, Streaming and Computational Assumptions

Simons Institute

Communication Complexity, Streaming and Computational Assumptions

Streamed 2 years ago - 1:01:21

A Classification of Computational Assumptions in the Algebraic Group Model

IACR

A Classification of Computational Assumptions in the Algebraic Group Model

4 years ago - 21:27

Allison Breton Bishop - A Survey of Computational Assumptions on Bilinear and Multilinear Maps

DIMACS CCICADA

Allison Breton Bishop - A Survey of Computational Assumptions on Bilinear and Multilinear Maps

6 years ago - 1:03:40

Self-testing of a single quantum device under computational assumptions

Simons Institute

Self-testing of a single quantum device under computational assumptions

4 years ago - 22:53

Device-Independent Protocols From Computational Assumptions

Simons Institute

Device-Independent Protocols From Computational Assumptions

Streamed 3 years ago - 43:50

The Quest for the Minimal Hardness Assumptions

Microsoft Research

The Quest for the Minimal Hardness Assumptions

8 years ago - 56:04

STOC24 6 B 5 Nonlocality under Computational Assumptions

SIGACT EC

STOC24 6 B 5 Nonlocality under Computational Assumptions

11 months ago - 16:39

[POPL 2021] The Taming of the Rew: A Type Theory with Computational Assumptions (full)

ACM SIGPLAN

[POPL 2021] The Taming of the Rew: A Type Theory with Computational Assumptions (full)

4 years ago - 27:52

QCrypt 2021: Device-independent protocols from computational assumptions

QCrypt conference

QCrypt 2021: Device-independent protocols from computational assumptions

3 years ago - 24:40

Two-round Secure Multiparty Computations from Minimal Assumptions

Microsoft Research

Two-round Secure Multiparty Computations from Minimal Assumptions

7 years ago - 49:07

Towards a Classification of Non interactive Computational Assumptions in Cyclic Groups

IACR

Towards a Classification of Non interactive Computational Assumptions in Cyclic Groups

7 years ago - 27:13

Fang Song: Zero-knowledge proof systems for QMA

Microsoft Research

Fang Song: Zero-knowledge proof systems for QMA

8 years ago - 31:38

Separating Succinct Non-Interactive Arguments From All Falsifiable Assumptions

Microsoft Research

Separating Succinct Non-Interactive Arguments From All Falsifiable Assumptions

8 years ago - 53:58

Minimal Complexity Assumptions for Cryptography (Part I)

Simons Institute

Minimal Complexity Assumptions for Cryptography (Part I)

Streamed 2 years ago - 1:03:11

Anne Broadbent - Secure Software Leasing Without Assumptions

Joshuah Heath

Anne Broadbent - Secure Software Leasing Without Assumptions

4 years ago - 52:35

The Isogeny Club #6.5 Unpredictability Assumptions, and Applying Generic Proof Systems to Isogenies

The Isogeny Club

The Isogeny Club #6.5 Unpredictability Assumptions, and Applying Generic Proof Systems to Isogenies

1 month ago - 54:34

Classical Commitment to Quantum States

Simons Institute

Classical Commitment to Quantum States

5 years ago - 55:32

Quantum Supremacy and its Applications

Simons Institute

Quantum Supremacy and its Applications

6 years ago - 49:29

Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techn...

IACR

Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techn...

3 years ago - 31:02

Ilya Merkulov: Entropy Accumulation under Post-Quantum Cryptographic Assumptions

UMIACS

Ilya Merkulov: Entropy Accumulation under Post-Quantum Cryptographic Assumptions

1 year ago - 18:36

Computational Limits in Statistical Inference: Hidden Cliques and Sum of Squares

Microsoft Research

Computational Limits in Statistical Inference: Hidden Cliques and Sum of Squares

8 years ago - 1:03:30

A Logic and an Interactive Prover for the Computational Post-Quantum Security of Protocols

IEEE Symposium on Security and Privacy

A Logic and an Interactive Prover for the Computational Post-Quantum Security of Protocols

2 years ago - 18:04

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

Institute for Pure & Applied Mathematics (IPAM)

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

7 years ago - 55:31

Dakshita Khurana - Weakening Assumptions in Quantum Cryptography IV.b Part 2 of 2 - IPAM at UCLA

Institute for Pure & Applied Mathematics (IPAM)

Dakshita Khurana - Weakening Assumptions in Quantum Cryptography IV.b Part 2 of 2 - IPAM at UCLA

2 years ago - 1:39:44

Testing Assumptions of Learning Algorithms

Simons Institute

Testing Assumptions of Learning Algorithms

Streamed 1 year ago - 59:09

Discrete logarithm problem I - Hardness assumptions and usage

Tanja Lange: Cryptology

Discrete logarithm problem I - Hardness assumptions and usage

3 years ago - 20:22

An Algebraic Framework for Diffie-Hellman Assumptions

IACR

An Algebraic Framework for Diffie-Hellman Assumptions

11 years ago - 19:44

😂 FAILURE: Computational Photography & Medium Format assumptions

Theoria Apophasis

😂 FAILURE: Computational Photography & Medium Format assumptions

6 years ago - 14:54

Learning With Errors (LWE) and Public Key Encryption || @ CMU || Lecture 25d of CS Theory Toolkit

Ryan O'Donnell

Learning With Errors (LWE) and Public Key Encryption || @ CMU || Lecture 25d of CS Theory Toolkit

4 years ago - 25:54

Incompressiblity and Next-Block Pseudoentropy

Simons Institute

Incompressiblity and Next-Block Pseudoentropy

Streamed 2 years ago - 46:30

DOE CSGF 2022: Communication-Efficient Secure Two-Party Computation From Minimal Assumptions

Krell Institute

DOE CSGF 2022: Communication-Efficient Secure Two-Party Computation From Minimal Assumptions

2 years ago - 15:55

Black-Hole Radiation Decoding as a Cryptographic Assumption

Simons Institute

Black-Hole Radiation Decoding as a Cryptographic Assumption

Streamed 2 years ago - 47:20

Whole Brain Emulation: The Logical Endpoint of Neuroinformatics?

Google TechTalks

Whole Brain Emulation: The Logical Endpoint of Neuroinformatics?

15 years ago - 58:55

Hardness vs. Randomness I: Graduate Complexity Lecture 24 at CMU

Ryan O'Donnell

Hardness vs. Randomness I: Graduate Complexity Lecture 24 at CMU

7 years ago - 1:22:26

Mark Zhandry - Security Reductions (Part 1)

The BIU Research Center on Applied Cryptography and Cyber Security

Mark Zhandry - Security Reductions (Part 1)

4 years ago - 1:00:29

"Cryptography from Pseudorandom Quantum States", presented by Henry Yuen

Illinois Quantum

"Cryptography from Pseudorandom Quantum States", presented by Henry Yuen

Streamed 3 years ago - 1:02:16

Reducibility and Statistical-Computational Gaps from Secret Leakage

COLT

Reducibility and Statistical-Computational Gaps from Secret Leakage

4 years ago - 15:10

Nir Bitansky & Zvika Brakerski - School Overview

The BIU Research Center on Applied Cryptography and Cyber Security

Nir Bitansky & Zvika Brakerski - School Overview

4 years ago - 42:41

Hardness vs. Randomness II: Graduate Complexity Lecture 25 at CMU

Ryan O'Donnell

Hardness vs. Randomness II: Graduate Complexity Lecture 25 at CMU

7 years ago - 1:17:53

What are the assumptions of logistic regression? #datascienceinterviewquestions #machinelearning

Data Depth

What are the assumptions of logistic regression? #datascienceinterviewquestions #machinelearning

1 year ago - 0:31

Quantum Algorithms and Post-Quantum Cryptography

Simons Institute

Quantum Algorithms and Post-Quantum Cryptography

Streamed 5 years ago - 49:23

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

Simons Institute

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

Streamed 2 years ago - 46:10

The Turing Legacy

The Royal Society

The Turing Legacy

12 years ago - 19:13

The Biggest Problem in Cryptography ⚠️ #short

Stemble

The Biggest Problem in Cryptography ⚠️ #short

1 year ago - 0:49

Florian Speelman: Quantum homomorphic encryption for polynomial-sized circuits (Best Student Paper)

Microsoft Research

Florian Speelman: Quantum homomorphic encryption for polynomial-sized circuits (Best Student Paper)

8 years ago - 53:54

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

Simons Institute

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

3 years ago - 45:52

Contention in Cryptography: Obfuscation, Leakage, UCE and the AI-DHI Assumptions

Simons Institute

Contention in Cryptography: Obfuscation, Leakage, UCE and the AI-DHI Assumptions

9 years ago - 30:43

FOCS 2024 6A Succinct arguments for QMA from standard assumptions via compiled nonlocal games

FOCS 2024

FOCS 2024 6A Succinct arguments for QMA from standard assumptions via compiled nonlocal games

7 months ago - 22:23

The dumbest redstone build ever

CraftyMasterman

The dumbest redstone build ever

1 year ago - 0:34

Indistinguishability Obfuscation from Simple-to-State Hard Problems

Simons Institute

Indistinguishability Obfuscation from Simple-to-State Hard Problems

5 years ago - 1:24:58

Post‑Quantum Cryptography: Securing Data Against Future Quantum Threats | #PostQuantum, #QuantumSafe

CodeVisium

Post‑Quantum Cryptography: Securing Data Against Future Quantum Threats | #PostQuantum, #QuantumSafe

1 month ago - 0:10

Laptops wouldn't exist without Quantum Mechanics

Qiskit

Laptops wouldn't exist without Quantum Mechanics

2 years ago - 0:17

Tina Zhang (MIT) — Succinct arguments for QMA from standard assumptions via compiled nonlocal games

QuSoft

Tina Zhang (MIT) — Succinct arguments for QMA from standard assumptions via compiled nonlocal games

4 months ago - 51:15

Round Optimal Secure Multiparty Computation from Minimal Assumptions

IACR

Round Optimal Secure Multiparty Computation from Minimal Assumptions

4 years ago - 22:10

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

lanl-ansi

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

6 years ago - 19:39

Constraining and Watermarking PRFs from Milder Assumptions

IACR

Constraining and Watermarking PRFs from Milder Assumptions

5 years ago - 21:40