Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation
Crossref DOI link: https://doi.org/10.1007/s00453-019-00576-7
Published Online: 2019-05-17
Published Print: 2019-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Datta, Pratish
Dutta, Ratna
Mukhopadhyay, Sourav
Text and Data Mining valid from 2019-05-17
Version of Record valid from 2019-05-17
Article History
Received: 15 February 2018
Accepted: 15 April 2019
First Online: 17 May 2019