搜索结果: 1-15 共查到“军事学 Exact”相关记录28条 . 查询时间(0.078 秒)
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs
Lattices Zero-Knowledge Proofs Commitments
2019/6/4
A key component of many lattice-based protocols is a zero-knowledge proof of knowledge of a vector s⃗ s→ with small coefficients satisfying As⃗ =u⃗ modqAs→=u→modq. While there exist ...
Cube attack is an important cryptanalytic technique against symmetric cryptosystems, especially for stream ciphers. The key step in cube attack is recovering superpoly. However, when cube size is larg...
Exact maximum expected differential and linear probability for 2-round Kuznyechik
Kuznyechik LSX MDS codes
2018/11/12
his paper presents the complete description of the best differentials and linear hulls in 2-round Kuznyechik. We proved that 2-round MEDP=2−86.66...MEDP=2−86.66..., MELP=2−76.739...M...
We settle the exact round complexity of three-party computation (3PC) in honest-majority setting, for a range of security notions such as selective abort, unanimous abort, fairness and guaranteed outp...
Traditionally, modes of Message Authentication Codes(MAC) such as Cipher Block Chaining (CBC) are instantiated using block ciphers or keyed Pseudo Random Permutations(PRP). However, one can also use d...
PMAC is a simple and parallel block-cipher mode of operation, which was introduced by Black and Rogaway at Eurocrypt 2002. If instantiated with a (pseudo)random permutation over n-bit strings, PMAC co...
On the Exact Round Complexity of Self-Composable Two-Party Computation
secure two-party computation concurrent security exact round complexity
2017/2/20
In contrast, round complexity of secure computation in the concurrent setting, where several protocols may run simultaneously, is poorly understood. Since standard polynomial time simulation is imposs...
Exact Security Analysis of Hash-then-Mask Type Probabilistic MAC Constructions
MAC secret-key cryptography
2016/12/8
Probabilistic MAC (message authentication code) is an alternative choice for a stateful MAC where maintaining internal state may be difficult or unsafe. Usually tag of a probabilistic MAC consists of ...
Key-alternating Ciphers and Key-length Extension: Exact Bounds and Multi-user Security
Symmetric cryptography block ciphers provable security
2016/6/6
This paper revisits the concrete security of key-alternating ciphers and key-length extension
schemes, with respect to tightness and multi-user security. The best existing bounds on the concrete
sec...
Exact Error Bound of Cox-Rower Architecture for RNS Arithmetic
cryptography implementation Residue Number System
2016/3/11
Residue Number System (RNS) is a method for representing an integer as an n-tuple of its residues with respect to a given base. Since RNS has inherent parallelism, it is actively researched to impleme...
The Exact Round Complexity of Secure Computation
Exact Round Complexity Multi-Party Computation Two-Party Computation
2016/3/9
We revisit the exact round complexity of secure computation in the multi-party and twoparty
settings. For the special case of two-parties without a simultaneous message exchange channel, this
questi...
The Exact PRF-Security of NMAC and HMAC
Message authentication codes pseudorandom functions NMAC
2016/1/8
NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a
variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular
and wid...
Randomizing Scalar Multiplication Using Exact Covering Systems of Congruences
Scalar Multiplication Covering Systems of Congruences Side-Channel Attacks
2015/12/30
In this paper we present a generic, uniformly randomized scalar multiplication
algorithm based on covering systems of congruences, with built-in protections against various
side-channel attacks. It ...
Indistinguishability Obfuscation: from Approximate to Exact
Functional Encryption Program Obfuscation Secure Function Evaluation
2015/12/24
We show general transformations from subexponentially-secure approximate indistinguishability
obfuscation (IO) where the obfuscated circuit agrees with the original circuit on a 1/2 +
fraction of ...
Rich Queries on Encrypted Data: Beyond Exact Matches
Search on Encrypted Data Searchable Symmetric Encryption SSE
2015/12/22
We extend the searchable symmetric encryption (SSE) protocol of [Cash et al., Crypto’13]
adding support for range, substring, wildcard, and phrase queries, in addition to the Boolean queries
support...