scientific article; zbMATH DE number 4051007

MaRDI QIDQ3787498zbMATH OpenFDO

Authors Oded Goldreich, Ronen Vainish

Publication date 1988

zbMATH Keywords

cryptographic protocolefficient computing of functionsinteracting Turing machinesmaximum privacyoblivious transfer

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 4191075
• scientific article; zbMATH DE number 176564
• Information Security and Cryptology
• Communication preserving protocols for secure function evaluation
• Secure multiparty computation without one-way functions

Cited in

(30)

• Private multiparty sampling and approximation of vector combinations
• Oblivious transfer in incomplete networks
• Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost
• Flexible quantum oblivious transfer
• Oblivious keyword search
• Secure non-interactive reduction and spectral analysis of correlations
• How should we solve search problems privately?
• Basing cryptographic protocols on tamper-evident seals
• scientific article; zbMATH DE number 1617945 (Why is no real title available?)
• Network oblivious transfer
• Efficient query protocol for database's privacy
• A new efficient protocol for k-out-of-n oblivious transfer
• On complete primitives for fairness
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Improved Garbled Circuit: Free XOR Gates and Applications
• Graph Design for Secure Multiparty Computation over Non-Abelian Groups
• Communication-Efficient Private Protocols for Longest Common Subsequence
• scientific article; zbMATH DE number 58318 (Why is no real title available?)
• scientific article; zbMATH DE number 1302806 (Why is no real title available?)
• Communication-efficient distributed oblivious transfer
• scientific article; zbMATH DE number 1759348 (Why is no real title available?)
• scientific article; zbMATH DE number 883899 (Why is no real title available?)
• Reducibility among protocols. (Extended abstract)
• Cryptography and cryptographic protocols
• OT-Combiners via Secure Computation
• Counting Method for Multi-party Computation over Non-abelian Groups
• Statistical Security Conditions for Two-Party Secure Function Evaluation
• Secure non-interactive reducibility is decidable
• Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions
• Generalized oblivious transfer by secret sharing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787498)