Rate-Limited Secure Function Evaluation: Definitions and Constructions

DOI10.1007/978-3-642-36362-7_28zbMath1314.94064OpenAlexW143274136MaRDI QIDQ4916025

Özgür Dagdelen, Payman Mohassel, Daniele Venturi

Publication date: 19 April 2013

Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_28

zbMATH Keywords

foundationssecure function evaluationoracle attackssecure meteringoblivious polynomial evaluation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Impossibility of Black-Box Simulation Against Leakage Attacks ⋮ Rate-limited secure function evaluation ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ Rate-Limited Secure Function Evaluation: Definitions and Constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Oblivious keyword search
• Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
• Efficient Set Operations in the Presence of Malicious Adversaries
• Text Search Protocols with Simulation Based Security
• Evaluating Branching Programs on Encrypted Data
• Distributed Private Data Analysis: Simultaneously Solving How and What
• Asynchronous Multiparty Computation: Theory and Implementation
• Secure Multiparty Computation Goes Live
• Rate-Limited Secure Function Evaluation: Definitions and Constructions
• 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

This page was built for publication: Rate-Limited Secure Function Evaluation: Definitions and Constructions