搜索结果: 1-15 共查到“军队指挥学 optimal way”相关记录197条 . 查询时间(0.085 秒)
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...
Optimal Collision Side-Channel Attacks
Side-channel analysis side-channel security evaluation collision attacks
2019/7/18
Collision side-channel attacks are efficient attacks against cryptographic implementations, however, optimal collision side-channel attacks and how to compute them efficiently is an open question. In ...
Optimal Collision Side-Channel Attacks
Side-channel analysis side-channel security evaluation collision attacks
2019/7/18
Collision side-channel attacks are efficient attacks against cryptographic implementations, however, optimal collision side-channel attacks and how to compute them efficiently is an open question. In ...
Highly Efficient Key Exchange Protocols with Optimal Tightness -- Enabling real-world deployments with theoretically sound parameters
AKE provable security tightness
2019/6/24
In this paper we give nearly-tight reductions for modern implicitly authenticated Diffie-Hellman protocols in the style of the Signal and Noise protocols which are extremely simple and efficient. Unli...
Synchronous Consensus with Optimal Asynchronous Fallback Guarantees
cryptographic protocols Byzantine agreement
2019/6/13
Typically, protocols for Byzantine agreement (BA) are designed to run in either a synchronous network (where all messages are guaranteed to be delivered within some known time ΔΔ from when they are se...
Security-Efficiency Tradeoffs in Searchable Encryption -- Lower Bounds and Optimal Constructions
searchable encryption lower bound
2019/6/13
Besides their security, the efficiency of searchable encryption schemes is a major criteria when it comes to their adoption: in order to replace an unencrypted database by a more secure construction, ...
On Round Optimal Statistical Zero Knowledge Arguments
zero knowledge collision resistance statistically hiding commitments
2019/6/4
We construct the first three message statistical zero knowledge arguments for all of NP, matching the known lower bound. We do so based on keyless multi-collision resistant hash functions and other st...
Optimal TNFS-secure pairings on elliptic curves with composite embedding degree
Optimal ate pairing twists of elliptic curves jacobian coordinates
2019/5/27
In this paper we present a comprehensive comparison between pairing-friendly elliptic curves, considering different curve forms and twists where possible. We define a measure of the efficiency of a pa...
Efficient Search for Optimal Diffusion Layers of Generalized Feistel Networks
Diffusion Round Feistel Permutations
2019/5/23
The Feistel construction is one of the most studied ways of building block ciphers. Several generalizations were then proposed in the literature, leading to the Generalized Feistel Network, where the ...
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
NFS optimal ate pairing computation
2019/4/28
Recent algorithmic improvements of discrete logarithm computation in special extension fields threaten the security of pairing-friendly curves used in practice. A possible answer to this delicate situ...
Hierarchical Attribute-based Signatures: Short Keys and Optimal Signature Length
Attribute-based Signatures delegation hierarchy path anonymity
2019/4/16
With Attribute-based Signatures (ABS) users can simultaneously sign messages and prove compliance of their attributes, issued by designated attribute authorities, with some verification policy. Neithe...
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation
Zero knowledge proof interactive proof polynomial delegation
2019/4/1
We present Libra, the first zero-knowledge proof system that has both optimal prover time and succinct proof size/verification time. In particular, if C is the size of the circuit being proved (i) the...
Optimal Bounded-Collusion Secure Functional Encryption
Bounded-Key Functional Encryption Correlated Garbling
2019/3/22
We construct private-key and public-key functional encryption schemes secure against adversaries that corrupt an a-priori bounded number of users and obtain their functional keys, from minimal assumpt...
Optimal Oblivious Priority Queues and Offline Oblivious RAM
Oblivious RAM Oblivious Priority Queue
2019/3/4
In this work, we present the first asymptotically optimal oblivious priority queue, which matches the lower bound of Jacob, Larsen, and Nielsen (SODA'19). Our construction is conceptually simple, stat...
Towards optimal robust secret sharing with security against a rushing adversary
security against rushing adversary
2019/3/2
Robust secret sharing enables the reconstruction of a secret-shared message in the presence of up to tt (out of nn) {\em incorrect} shares. The most challenging case is when n=2t+1n=2t+1, which is the...