Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World

DOI10.1007/978-3-662-46803-6_18zbMath1403.94047OpenAlexW845041233MaRDI QIDQ2948395

Ivan Visconti, Rafail Ostrovsky, Melissa Chase

Publication date: 30 September 2015

Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_18

zbMATH Keywords

PCP of proximitysecure computationFHEproofs of workinput-size hidingideal world

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

Hiding the input-size in multi-party private set intersection ⋮ Size-Hiding Computation for Multiple Parties ⋮ Bounded Size-Hiding Private Set Intersection

This page was built for publication: Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World