Work

Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems.

Year: 2012

Type: preprint

Source: IACR Cryptology ePrint Archive

Authors: Eli Ben‐Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer

Language: English

Topic: Cryptography and Data Security

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W3028987847

Cites: 28

Cited by: 36

Related to: 10