scientific article
From MaRDI portal
Publication:3210139
zbMath0722.68007MaRDI QIDQ3210139
Publication date: 1991
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Cryptography (94A60) Communication theory (94A05)
Related Items (10)
Computational hardness of optimal fair computation: beyond Minicrypt ⋮ On the structure of unconditional UC hybrid protocols ⋮ Mathematical problems in cryptology ⋮ Completeness for symmetric two-party functionalities: revisited ⋮ Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions ⋮ Susceptible Two-Party Quantum Computations ⋮ The privacy of dense symmetric functions ⋮ On privacy and partition arguments ⋮ Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority ⋮ On the structure of the privacy hierarchy
This page was built for publication:
