Secure multiparty computation without one-way functions

MaRDI QIDQ5215785zbMATH OpenFDO

Authors Vladimir Shpilrain, Dima Grigoriev

Publication date 13 February 2020

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Secrecy without one-way functions
• Secure multiparty computations without computers
• Communication preserving protocols for secure function evaluation
• Secure Arithmetic Computation with No Honest Majority
• scientific article; zbMATH DE number 1304184

Cited in

(20)

• Secure two-party computation: a visual way
• Polynomial expressions of \(p\)-ary auction functions
• Public-PEZ Cryptography
• Summing over a network without revealing summands
• Secure computation from millionaire
• Characterization of secure multiparty computation without broadcast
• Secure Multiparty Computations Using a Dial Lock
• scientific article; zbMATH DE number 4051007 (Why is no real title available?)
• A secure three-party computational protocol for triangle area
• Theory and Applications of Models of Computation
• Multi-party computation of polynomials and branching programs without simultaneous interaction
• A Single Initialization Server for Multi-party Cryptography
• scientific article; zbMATH DE number 1830731 (Why is no real title available?)
• Instantaneous decentralized poker
• Multiparty computation, an introduction
• Multi-party computation based on physical coins
• Secure computation without computers
• Non-interactive secure computation from one-way functions
• Secure Multiparty Computations Using the 15 Puzzle
• Secrecy without one-way functions

This page was built for publication: Secure multiparty computation without one-way functions

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