scientific article
From MaRDI portal
Publication:3210162
zbMath0722.68041MaRDI QIDQ3210162
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Two-round MPC: information-theoretic and black-box ⋮ Two-message statistically sender-private OT from LWE ⋮ Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes ⋮ Channels of small log-ratio leakage and characterization of two-party differentially private computation ⋮ The Simplest Protocol for Oblivious Transfer ⋮ Reverse firewalls for oblivious transfer extension and applications to zero-knowledge ⋮ Existence of 3-round zero-knowledge proof systems for NP ⋮ Endemic oblivious transfer via random oracles, revisited ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Improved Garbled Circuit: Free XOR Gates and Applications ⋮ Acyclicity programming for sigma-protocols ⋮ Flexible quantum oblivious transfer ⋮ Communication-efficient distributed oblivious transfer ⋮ Blind Identity-Based Encryption and Simulatable Oblivious Transfer ⋮ Cryptography and Game Theory: Designing Protocols for Exchanging Information ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ Compact, efficient and UC-secure isogeny-based oblivious transfer ⋮ The rise of Paillier: homomorphic secret sharing and public-key silent OT ⋮ Oblivious keyword search ⋮ Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens ⋮ Oblivious polynomial evaluation and oblivious neural learning ⋮ Oblivious Transfer Based on the McEliece Assumptions ⋮ Decentralized Anonymous Micropayments ⋮ Two-round oblivious transfer from CDH or LPN
This page was built for publication:
