搜索结果: 1-15 共查到“revisited”相关记录360条 . 查询时间(0.078 秒)
WI Is Not Enough: Zero-Knowledge Contingent (Service) Payments Revisited
ZK contingent payments Bitcoin zkSNARKs
2019/8/27
While fair exchange of goods is known to be impossible without assuming a trusted party, smart contracts in cryptocurrencies forgo such parties by assuming trust in the currency system. They allow a s...
Efficient zero-knowledge arguments in the discrete log setting, revisited
zero-knowledge argument quadratic equations arithmetic circuit satisfiability
2019/8/20
This work revisits zero-knowledge proofs in the discrete logarithm setting. First, we identify and carve out basic techniques (partly being used implicitly before) to optimize proofs in this setting. ...
Module-LWE versus Ring-LWE, Revisited
Lattice-based Cryptography Security Reduction Cyclotomic Fields
2019/8/19
Till now, the only reduction from the module learning with errors problem (MLWE) to the ring learning with errors problem (RLWE) is given by Albrecht et al.et al. in ASIACRYPT 20172017. Reductions fro...
Although Byzantine Agreement (BA) has been studied for three decades, perhaps somewhat surprisingly, there still exist significant gaps in our understanding regarding its round complexity. First, alth...
In recent years, there has been a proliferation of algebraically structured Learning With Errors (LWE) variants, including Ring-LWE, Module-LWE, Polynomial-LWE, Order-LWE, and Middle-Product LWE, and ...
The Notion of Transparency Order, Revisited
Transparency order Differential power analysis S-box
2019/6/12
We revisit the definition of Transparency Order (TO) and that of Modified Transparency Order (MTO) as well, which were proposed to measure the resistance of an S-box against Differential Power Analysi...
Private Simultaneous Messages (PSM) is a minimal model for information-theoretic non-interactive multi-party computation. In the 2-party case, Beimel et al. showed every function f:[N]×[N]→{0,1}f:[N]×...
We draw attention to a gap between theory and usage of nonce-based symmetric encryption, under which the way the former treats nonces can result in violation of privacy in the latter. We bridge the ga...
Protecting ECC Against Fault Attacks: The Ring Extension Method Revisited
Elliptic curves formal groups degenerate curves
2019/5/21
Due to its shorter key size, elliptic curve cryptography (ECC) is gaining more and more popularity. However, if not properly implemented, the resulting cryptosystems may be susceptible to fault attack...
GALACTICS: Gaussian Sampling for Lattice-Based Constant-Time Implementation of Cryptographic Signatures, Revisited
Timing Attack Phase Retrieval algorithms Constant-time Implementation
2019/5/21
In this paper, we propose a constant-time implementation of the BLISS lattice-based signature scheme. BLISS is possibly the most efficient lattice-based signature scheme proposed so far, with a level ...
Theory and application of computationally independent one-way functions: Interactive proof of ability - Revisited
one-way functions zero knowledge proof computational independence
2019/4/1
We introduce the concept of computationally independent pair of one-way functions (CI-OWF). We also provide two rich classes of examples of such functions based on standard assumptions. We revisit two...
Leakage Certification Revisited: Bounding Model Errors in Side-Channel Security Evaluations
side-channel analysis security evaluations mutual information
2019/2/27
Leakage certification aims at guaranteeing that the statistical models used in side-channel security evaluations are close to the true statistical distribution of the leakages, hence can be used to ap...
Pairing-based cryptography is now a mature science. However implementation of a pairing-based protocol can be challenging, as the efficient computation of a pairing is difficult, and the existing lite...
Sum-of-Squares Meets Program Obfuscation, Revisited
Sum-of-Squares Indistinguishability Obfuscation
2019/1/2
We develop attacks on the security of variants of pseudo-random generators computed by quadratic polynomials. In particular we give a general condition for breaking the one-way property of mappings wh...
Mixing Networks are protocols that allow a set of senders to send messages anonymously. Such protocols are fundamental building blocks to achieve privacy in a variety of applications, such as anonymou...