搜索结果: 1-8 共查到“知识库 军事学 linear time”相关记录8条 . 查询时间(0.094 秒)
Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution
Zero-knowledge proofs succinct arguments of knowledge TinyRAM
2018/5/2
There have been tremendous advances in reducing interaction, communication and verification time in zero-knowledge proofs but it remains an important challenge to make the prover efficient. We constru...
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability
Zero-knowledge arithmetic circuit ideal linear commitments
2017/9/14
We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit satisfiability over a large field. For a circuit with N addition and multiplication gates, the prover only u...
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model
Non-malleable codes Bit-Wise Independent Tampering Model
2016/4/22
Non-malleable codes were introduced by Dziembowski et al. (ICS 2010) as coding schemes that protect a message against tampering attacks. Roughly speaking, a code is non-malleable if decoding an advers...
Computing theta functions in quasi-linear time in genus 2 and above
number theory hyperelliptic curves theta functions
2016/2/24
We outline an algorithm to compute θ(z, τ ) in genus 2 in quasi-optimal time, borrowing
ideas from the algorithm for theta constants and the one for θ(z, τ ) in genus 1. Our
implementation shows a l...
Rate-1, Linear Time and Additively Homomorphic UC Commitments
commitment asymptotic efficiency universal composability
2016/2/23
We propose the first UC commitment scheme for binary
strings with the optimal properties of rate approaching 1 and linear time
(in the amortised sense, using a small number of seed OTs). On top of
...
Computing Jacobi's \theta in quasi-linear time
number theory elliptic curve cryptosystem theta function
2015/12/21
Jacobi’s θ function has numerous applications in mathematics and computer science; a
naive algorithm allows the computation of θ(z, τ ), for z, τ verifying certain conditions, with
precision P in O(...
Near-linear time, Leakage-resilient Key Evolution Schemes from Expander Graphs
secret-key cryptography
2014/3/5
We develop new schemes for deterministically updating a stored cryptographic key that provide security against an internal adversary who can control the update computation and leak bounded amounts of ...
1. AES seems weak. 2. Linear time secure cryptography
AES Linear Linear time secure cryptography
2008/8/19
We describe a new simple but more power-
ful form of linear cryptanalysis. It appears to break AES
(and undoubtably other cryptosystems too, e.g. SKIP-
JACK). The break is “nonconstructive,” i.e. w...