scientific article
From MaRDI portal
Publication:3787498
zbMath0644.68077MaRDI QIDQ3787498
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
oblivious transfercryptographic protocolefficient computing of functionsinteracting Turing machinesmaximum privacy
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (21)
Oblivious transfer in incomplete networks ⋮ Secure non-interactive reduction and spectral analysis of correlations ⋮ Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost ⋮ Secure non-interactive reducibility is decidable ⋮ Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions ⋮ Generalized oblivious transfer by secret sharing ⋮ Improved Garbled Circuit: Free XOR Gates and Applications ⋮ Flexible quantum oblivious transfer ⋮ Communication-efficient distributed oblivious transfer ⋮ Cryptography and cryptographic protocols ⋮ A New Efficient Protocol for k-out-of-n Oblivious Transfer ⋮ Basing cryptographic protocols on tamper-evident seals ⋮ Graph Design for Secure Multiparty Computation over Non-Abelian Groups ⋮ OT-Combiners via Secure Computation ⋮ Private multiparty sampling and approximation of vector combinations ⋮ Network Oblivious Transfer ⋮ Oblivious keyword search ⋮ On Complete Primitives for Fairness ⋮ Founding Cryptography on Tamper-Proof Hardware Tokens ⋮ Counting Method for Multi-party Computation over Non-abelian Groups ⋮ Statistical Security Conditions for Two-Party Secure Function Evaluation
This page was built for publication:
