搜索结果: 1-15 共查到“密码学 arithmetic circuits”相关记录15条 . 查询时间(0.106 秒)
Commodity-Based 2PC for Arithmetic Circuits
Secure Two-Party Computation Information Theoretic Security Oblivious Linear Evaluation
2019/6/19
We revisit the framework of Commodity-based Cryptography presented by Beaver (STOC'97) with a focus on updating the framework to fit with modern multiparty computation (MPC) protocols. We study the po...
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
zero-knowledge lattice cryptography MPC
2019/5/23
In this work we present a new interactive Zero-Knowledge Argument of knowledge for general arithmetic circuits. Our protocol is based on the ``MPC-in-the-head''-paradigm of Ishai et al. (STOC 2009) an...
Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits
Zero-Knowledge Arithmetic Circuits Sub-linear proofs
2018/6/5
We propose the first zero-knowledge argument with sub-linear communication complexity for arithmetic circuit satisfiability over a prime pp whose security is based on the hardness of the short integer...
On Multiparty Garbling of Arithmetic Circuits
Arithmetic Garbled Circuits Constant Round MPC Multiparty Garbling
2017/12/13
We initiate a study of garbled circuits that contain both Boolean and arithmetic gates in secure multiparty computation. In particular, we incorporate the garbling gadgets for arithmetic circuits rece...
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority
cryptographic protocols Honest-Majority
2017/9/1
Protocols for secure multiparty computation enable a set of parties to compute a function of their inputs without revealing anything but the output. The security properties of the protocol must be pre...
5Gen-C: Multi-input Functional Encryption and Program Obfuscation for Arithmetic Circuits
obfuscation multi-input functional encryption
2017/9/1
Program obfuscation is a powerful security primitive with many applications. White-box cryptography studies a particular subset of program obfuscation targeting keyed pseudorandom functions (PRFs), a ...
On the Untapped Potential of Encoding Predicates by Arithmetic Circuits and Their Applications
Predicates verifiable random functions predicate encryption schemes
2017/8/29
Predicates are used in cryptography as a fundamental tool to control the disclosure of secrets. However, how to embed a particular predicate into a cryptographic primitive is usually not given much at...
Garbling Gadgets for Boolean and Arithmetic Circuits
garbled circuits secure computation arithmetic circuits
2016/12/8
We present simple, practical, and powerful new techniques for garbled circuits. These techniques
result in significant concrete and asymptotic improvements over the state of the art, for several natu...
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
Sigma-protocol zero-knowledge argument arithmetic circuit
2016/3/9
We provide a zero-knowledge argument for arithmetic circuit
satisfiability with a communication complexity that grows logarithmically
in the size of the circuit. The round complexity is also logarit...
Practical Homomorphic MACs for Arithmetic Circuits
message authentication codes homomorphic authenticators secure outsourcing
2016/1/3
Homomorphic message authenticators allow the holder of a (public) evaluation key to
perform computations over previously authenticated data, in such a way that the produced tag σ can
be used to cert...
Generalizing Homomorphic MACs for Arithmetic Circuits
Homomorphic Message Authentication Codes Secure Outsourcing Verifiable Computation
2015/12/31
Homomorphic MACs, introduced by Gennaro and Wichs in
2013, allow anyone to validate computations on authenticated data without
knowledge of the secret key. Moreover, the secret-key owner can verify
...
We present an Attribute Based Encryption system where access policies are expressed as polynomial size arithmetic circuits. We prove security against arbitrary collusions of users based on the learnin...
Sign Modules in Secure Arithmetic Circuits
cryptographic protocols / multi-party computation arithmetic black-box unconditional security
2012/3/23
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure multiplications. We obse...
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
foundations / Fully-homomorphic encryption
2012/3/28
We describe a new approach for constructing fully homomorphic encryption (FHE) schemes. Previous FHE schemes all use the same blueprint from [Gentry 2009]: First construct a somewhat homomorphic encry...
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
foundations / Fully-homomorphic encryption
2011/6/9
All currently known fully homomorphic encryption (FHE) schemes use the same blueprint from [Gentry 2009]: First construct a somewhat homomorphic encryption (SWHE) scheme, next "squash" the decryption ...