Seminar • Algorithms and Complexity • Fiat-Shamir in the Plain Model from DerandomizationExport this event to calendar

Wednesday, October 25, 2023 — 12:00 PM to 1:00 PM EDT

Please note: This seminar will take place in M3 4206 and virtually.

Roei Tell, Assistant Professor
Department of Computer and Mathematical Sciences, University of Toronto

Do efficient algorithms believe that NP = PSPACE? Under strong complexity-theoretic assumptions, we prove that every problem in PSPACE can be solved by an NP-type verifier running in polynomial time that looks correct to any efficient observer (i.e., it has computational soundness). For example, the PSPACE-complete problem TQBF can be decided by a polytime NP-type verifier V, interacting with an honest prover whose runtime is T(n) = 2^O(n), such that no adversary running in time poly(T) can find an input and a proof that mislead V (except with probability negligible in T over the adversary’s coins).

The proof uses recent techniques from non-black-box derandomization in order to compile the interactive proof system underlying IP = PSPACE into a deterministic (non-interactive) argument system. This is an instance from a broader set of results applying derandomization-based techniques and assumptions to instantiate (versions of) the Fiat-Shamir heuristic in cryptography, in the plain model and without (or with weak) cryptographic assumptions.

From an upcoming joint work with Lijie Chen and Ron Rothblum.


To attend this seminar in person, please go to M3 4206. You can also attend virtually using Zoom at https://uwaterloo.zoom.us/j/95773268163.

Location 
Hybrid: M3 4206 | Online seminar
200 University Avenue West

Waterloo, ON N2L 3G1
Canada
Event tags 

S M T W T F S
26
27
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
6
  1. 2024 (166)
    1. August (3)
    2. July (5)
    3. June (17)
    4. May (23)
    5. April (41)
    6. March (27)
    7. February (25)
    8. January (25)
  2. 2023 (296)
    1. December (20)
    2. November (28)
    3. October (15)
    4. September (25)
    5. August (30)
    6. July (30)
    7. June (22)
    8. May (23)
    9. April (32)
    10. March (31)
    11. February (18)
    12. January (22)
  3. 2022 (245)
  4. 2021 (210)
  5. 2020 (217)
  6. 2019 (255)
  7. 2018 (217)
  8. 2017 (36)
  9. 2016 (21)
  10. 2015 (36)
  11. 2014 (33)
  12. 2013 (23)
  13. 2012 (4)
  14. 2011 (1)
  15. 2010 (1)
  16. 2009 (1)
  17. 2008 (1)