On Black-Box Complexity of Universally Composable Security in the CRS Model
Crossref DOI link: https://doi.org/10.1007/s00145-019-09326-y
Published Online: 2019-05-08
Published Print: 2019-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hazay, Carmit
Venkitasubramaniam, Muthuramakrishnan
Text and Data Mining valid from 2019-05-08
Article History
Received: 13 September 2015
Revised: 15 April 2019
First Online: 8 May 2019
Free to read: This content has been made available to all.