Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation

DOI10.1007/11593447_8MaRDI QIDQ5451068zbMATH OpenOpenAlexFDO

Authors Vladimir Kolesnikov

Publication date 18 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11593447_8

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
• Improved Garbled Circuit: Free XOR Gates and Applications
• Communication preserving protocols for secure function evaluation
• Efficient non-interactive secure computation
• Computing Functions of a Shared Secret

Cited in

(17)

• Actively secure polynomial evaluation from shared polynomial encodings
• How to circumvent the two-ciphertext lower bound for linear garbling schemes
• Multiparty quantum private comparison based on quantum walks
• Secure two-party computation: a visual way
• Function secret sharing for mixed-mode and fixed-point secure computation
• Towards building efficient SCALES protocols
• Pseudorandom correlation functions for garbled circuits
• Cryptography with weak privacy
• Threshold garbled circuits and ad hoc secure computation
• Tree-based quantum anonymous ranking protocol
• Lower bounds for garbled circuits from Shannon-type information inequalities
• Secure circuit evaluation. A protocol based on hiding information from an oracle
• Hashing garbled circuits for free
• Improved Garbled Circuit: Free XOR Gates and Applications
• Secure computation without computers
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Statistical security in two-party computation revisited

This page was built for publication: Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation

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