On the Feasibility of Consistent Computations

DOI10.1007/978-3-642-13013-7_6zbMath1279.94094OpenAlexW1920750829MaRDI QIDQ3562890

Helger Lipmaa, Sven Laur

Publication date: 28 May 2010

Published in: Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13013-7_6

zbMATH Keywords

consistencyoblivious transferequivocal and extractable commitmentprivate inference control

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Succinct NP Proofs from an Extractability Assumption

This page was built for publication: On the Feasibility of Consistent Computations