"Constrained Pseudorandom Functions for Turing Machines Revisited: How to ..."

Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-019-00576-7

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DattaDM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DattaDM19
Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay:
Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation. Algorithmica 81(9): 3245-3390 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.