ICALP 2020

C2.D – Can Verifiable Delay Functions be Based on Random Oracles?

Sep 23, 2020

|

33 views

Saarland Informatics Campus

Details

ICALP-A 2020 Can Verifiable Delay Functions be Based on Random Oracles? Mohammad Mahmoody, Caleb Smith, David J. Wu

Category: ICALP 2020

Comments

loading...

Reactions (0) | Note

📝 No reactions yet

Be the first one to share your thoughts!

Reactions(0)

Note

loading...

Recommended

ICAPS 2014: Aijun Bai on "Thompson Sampling Based Monte-Carlo Planning in POMDPs"

ICAPS | Jul 3, 2014

ICAPS 2014: Satish Kumar on "A Tree-Based Algorithm for Construction Robots"

ICAPS | Jul 16, 2014

ICAPS 2014: Peter Ondruska on "The Route Not Taken: Driver-Centric Estimation..."

ICAPS | Jul 21, 2014

ICAPS 2014: Franc Ivankovic on "Optimal Planning with Global Numerical State Constraints"

ICAPS | Jul 23, 2014

ICAPS 2014: Enrico Scala on "Plan Repair for Resource Constrained Tasks via Numeric Macro Actions"

ICAPS | Jul 23, 2014