Rate-limited secure function evaluation: definitions and constructions
From MaRDI portal
Recommendations
Cites work
- Asynchronous Multiparty Computation: Theory and Implementation
- Computationally secure pattern matching in the presence of malicious adversaries
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Efficient set operations in the presence of malicious adversaries
- Efficient Two-Party Secure Computation on Committed Inputs
- Evaluating Branching Programs on Encrypted Data
- scientific article; zbMATH DE number 176568 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- scientific article; zbMATH DE number 1406782 (Why is no real title available?)
- Oblivious keyword search
- Rate-limited secure function evaluation: definitions and constructions
- Secure multiparty computation goes live
- Text search protocols with simulation based security
- Theory of Cryptography
Cited in
(6)- scientific article; zbMATH DE number 1583777 (Why is no real title available?)
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Rate-limited secure function evaluation
- Impossibility of black-box simulation against leakage attacks
- Rate-limited secure function evaluation: definitions and constructions
- Communication preserving protocols for secure function evaluation
This page was built for publication: Rate-limited secure function evaluation: definitions and constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916025)