搜索结果: 1-15 共查到“Function Evaluation”相关记录25条 . 查询时间(0.109 秒)
Private Function Evaluation with Cards
Card-based protocols RAM machine Branching program
2018/11/20
Card-based protocols allow to evaluate an arbitrary fixed Boolean function ff on a hidden input to obtain a hidden output, without the executer learning anything about either of the two (e.g. Crépeau ...
Highly Efficient and Reusable Private Function Evaluation with Linear Complexity
Private function evaluation Secure 2-party computation Communication complexity
2018/5/28
Private function evaluation aims to securely compute a function f (x_1 , . . ., x_n ) without leaking any information other than what is revealed by the output, where f is a private input of one of th...
We introduce a new cryptographic primitive called laconic function evaluation (LFE). Using LFE, Alice can compress a large circuit ff into a small digest. Bob can encrypt some data xx under this diges...
High-Precision Privacy-Preserving Real-Valued Function Evaluation
Multiparty Computation Numerical Precision Fourier
2017/12/25
We propose a novel multi-party computation protocol for evaluating continuous real-valued functions with high numerical precision. Our method is based on approximations with Fourier series and uses at...
We present a high-assurance software stack for secure function evaluation (SFE). Our stack consists of three components: i. a verified compiler (CircGen) that translates C programs into Boolean circui...
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation
Two-party computation Oblivious Linear Function Evaluation
2017/8/22
Conceptually our techniques lift the techniques for basing practical actively secure 2PC of Boolean circuits on OT introduced under the name TinyOT by Nielsen, Nordholt, Orlandi and Burra at Crypto 20...
Towards Practical PFE: An Efficient 2-Party Private Function Evaluation Protocol Based on Half Gates
Private function evaluation Secure 2-party computation Communication complexity
2017/5/16
Private function evaluation (PFE) is a special case of secure multi-party computation (MPC), where the function to be computed is known by only one party. PFE is useful in several real-life settings w...
Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead
OLE UC-secure OT-hybrid model
2017/5/15
In this work we consider the problem of oblivious linear function evaluation (OLE). OLE is a special case of oblivious polynomial evaluation (OPE) and deals with the oblivious evaluation of a linear f...
Faster Homomorphic Function Evaluation using Non-Integral Base Encoding
public-key cryptography homomorphic function evaluation
2017/4/19
In this paper we present an encoding method for fixed-point numbers tailored for homomorphic function evaluation. The choice of the degree of the polynomial modulus used in all popular somewhat homomo...
Pinocchio-Based Adaptive zk-SNARKs and Secure/Correct Adaptive Function Evaluation
multi-party computation verifiable computation
2017/2/20
Pinocchio is a practical zk-SNARK that allows a prover to perform cryptographically verifiable computations with verification effort sometimes less than performing the computation itself. A recent pro...
Tile-Based Modular Architecture for Accelerating Homomorphic Function Evaluation on FPGA
FHE Homomorphic FPGA
2016/7/28
Fully Homomorphic Encryption is a powerful cryptographic tool that enables performing arbitrary meaningful computations over encrypted data. Despite its evolution over the past 7 years, FHE schemes ar...
OPFE: Outsourcing Computation for Private Function Evaluation
private function evaluation garbled circuits server-assisted cryptography
2016/1/27
Outsourcing secure multiparty computation (SMC) protocols has allowed resource-constrained devices
to take advantage of these developing cryptographic primitives with great efficiency. While the exis...
A Full Characterization of Completeness for Two-party Randomized Function Evaluation
Foundations Secure 2-party Randomized Function Evaluation Completeness Characterization
2016/1/26
We settle a long standing open problem which has pursued a full characterization of completeness of
(potentially randomized) finite functions for 2-party computation that is secure against active adv...
We propose the first general framework for designing actively secure private function evaluation
(PFE), not based on universal circuits. Our framework is naturally divided into pre-processing
and on...
On the Communication Complexity of Secure Function Evaluation with Long Output
Secure Function Evaluation Communication Complexity Indistinguishability Obfuscation
2016/1/7
We study the communication complexity of secure function evaluation (SFE). Consider
a setting where Alice has a short input xA, Bob has an input xB and we want Bob to learn
some function y = f(xA, x...