Rate-limited secure function evaluation
From MaRDI portal
Publication:329720
DOI10.1016/j.tcs.2016.09.020zbMath1353.94045OpenAlexW2530989744MaRDI QIDQ329720
Payman Mohassel, Özgür Dagdelen, Daniele Venturi
Publication date: 21 October 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.020
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient set operations in the presence of malicious adversaries
- A proof of security of Yao's protocol for two-party computation
- Oblivious keyword search
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
- Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
- Text Search Protocols with Simulation Based Security
- Evaluating Branching Programs on Encrypted Data
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Efficient Protocols for Set Membership and Range Proofs
- Asynchronous Multiparty Computation: Theory and Implementation
- Secure Multiparty Computation Goes Live
- Foundations of Cryptography
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Rate-Limited Secure Function Evaluation: Definitions and Constructions
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Outsourced Pattern Matching
- Advances in Cryptology - CRYPTO 2003
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient Two-Party Secure Computation on Committed Inputs
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Theory of Cryptography
- Public Key Cryptography - PKC 2006
- Theory of Cryptography
This page was built for publication: Rate-limited secure function evaluation
