搜索结果: 1-14 共查到“密码学 preprocessing”相关记录14条 . 查询时间(0.062 秒)
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS
succinct arguments universal SRS algebraic holographic proofs
2019/9/19
We present a methodology to construct preprocessing zkSNARKs where the structured reference string (SRS) is universal and updatable. This exploits a novel use of *holography* [Babai et al., STOC 1991]...
Optimal-Round Preprocessing-MPC via Polynomial Representation and Distributed Random Matrix (extended abstract)
MPC with preprocessing correlated randomness optimal round complexity
2019/9/16
We present preprocessing-MPC schemes of arithmetic functions with optimal round complexity, function-independent correlated randomness, and communication and space complexities that grow linearly with...
Designated Verifier/Prover and Preprocessing NIZKs from Diffie-Hellman Assumptions
Non-interactive zero-knowledge proofs Diffie-Hellman assumptions Homomorphic signatures
2019/3/1
In a non-interactive zero-knowledge (NIZK) proof, a prover can non-interactively convince a verifier of a statement without revealing any additional information. Thus far, numerous constructions of NI...
Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing
Secure Multiparty Computation SPDZ concrete efficiency
2019/1/29
Secure multiparty computation allows a set of mutually distrusting parties to securely compute a function of their private inputs, revealing only the output, even if some of the parties are corrupt. R...
Non-interactive zero-knowledge (NIZK) proofs are fundamental to modern cryptography. Numerous NIZK constructions are known in both the random oracle and the common reference string (CRS) models. In th...
The Discrete-Logarithm Problem with Preprocessing
discrete logarithm problem generic-group model
2017/11/21
This paper studies discrete-log algorithms that use preprocessing. In our model, an adversary may use a very large amount of precomputation to produce an "advice" string about a specific group (e.g., ...
When It’s All Just Too Much: Outsourcing MPC-Preprocessing
cryptographic protocols Outsourcing MPC-Preprocessing
2017/3/27
Most modern actively secure multiparty computation protocols make use of a function and input independent pre-processing phase. This pre-processing phase is tasked with producing some form of correlat...
Randomized lattice sieving for the closest vector problem (with preprocessing)
lattices sieving algorithms nearest neighbor searching
2016/12/9
In practice, the large memory footprint makes it problematic to run sieving directly on high-dimensional lattices, and perhaps the most promising application of such algorithms is as part of a hybrid ...
Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO
Secure Two-party Computation Implementation LEGO
2016/12/7
Secure two-party computation (S2PC) allows two parties to compute a function on their
joint inputs while leaking only the output of the function. At TCC 2009 Orlandi and Nielsen proposed
the LEGO pr...
Better Preprocessing for Secure Multiparty Computation
Efficient Multiparty Computation Preprocessing Homomorphic Encryption
2016/1/27
We present techniques and protocols for the preprocessing of secure multiparty computation
(MPC), focusing on the so-called SPDZ MPC scheme [19] and its derivatives [16,18,1]. These MPC
schemes cons...
Preprocessing-Based Verification of Multiparty Protocols with Honest Majority
secure multiparty computation verification
2015/12/29
This paper presents a generic method for turning passively
secure protocols into protocols secure against covert attacks, adding an
offline preprocessing and a cheap post-execution verification phas...
Linear Overhead Robust MPC with Honest Majority Using Preprocessing
cryptographic protocols MPC protocol
2015/12/24
We present a technique to achieve O(n) communication complexity per multiplication for a wide class
of robust practical MPC protocols. Previously such a communication complexity was only known in the...
SPDZ, TinyOT and MiniMAC are a family of MPC protocols based on secret sharing with
MACs, where a preprocessing stage produces multiplication triples in a finite field. This work describes
new proto...
Collision-Resistant usage of MD5 and SHA-1 via Message Preprocessing
SHA-1 MD5 padding hash collision ignature
2009/2/20
A series of recent papers have demonstrated collision attacks
on popularly used hash functions, including the widely deployed MD5
and SHA-1 algorithm. To assess this threat, the natural response has...
