Must You Know the Code of f to Securely Compute f?
From MaRDI portal
Publication:2914255
DOI10.1007/978-3-642-32009-5_7zbMath1294.94072OpenAlexW2145960412MaRDI QIDQ2914255
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_7
Related Items (5)
Round optimal black-box ``commit-and-prove ⋮ Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Secure Protocol Transformations
This page was built for publication: Must You Know the Code of f to Securely Compute f?
