搜索结果: 1-15 共查到“军事学 Beyond”相关记录67条 . 查询时间(0.079 秒)
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation
Fairness and Guaranteed Output Delivery MPC Round Complexity
2019/9/5
Two of the most sought-after properties of Multi-party Computation (MPC) protocols are fairness and guaranteed output delivery (GOD), the latter also referred to as robustness. Achieving both, however...
Fast Actively Secure Five-Party Computation with Security Beyond Abort
Secure Multiparty Computation Guaranteed Output Delivery Fairness
2019/7/26
Secure Multi-party Computation (MPC) with small population and honest majority has drawn focus specifically due to customization in techniques and resulting efficiency that the constructions can offer...
Plaintext Recovery Attacks against XTS Beyond Collisions
XTS Storage encryption Mode of operation
2019/7/17
XTS is an encryption scheme for storage devices standardized by IEEE and NIST. It is based on Rogaway's XEX tweakable block cipher and is known to be secure up to the collisions between the blocks, th...
The State of the Uniform: Attacks on Encrypted Databases Beyond the Uniform Query Distribution
Encrypted Database Attack Range Query
2019/5/5
Recent foundational work on leakage-based attacks on encrypted databases has broadened our understanding of what an adversary can accomplish with a standard leakage profile. Nevertheless, all known va...
Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound
authentication provable security permutation
2019/4/28
The combination of universal hashing and encryption is a fundamental paradigm for the construction of symmetric-key MACs, dating back to the seminal works by Wegman and Carter, Shoup, and Bernstein. W...
Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation
indistinguishability obfuscation functional encryption
2019/3/21
Every known construction of general indistinguishability obfuscation (iOiO) is either based on a family of exponentially many assumptions, or is based on a single assumption -- e.g.~functional encrypt...
Distributional Collision Resistance Beyond One-Way Functions
statistically hiding commitments distributional collision resistance
2019/2/27
Distributional collision resistance is a relaxation of collision resistance that only requires that it is hard to sample a collision (x,y) where x is uniformly random and y is uniformly random conditi...
Beyond Birthday Bound Secure MAC in Faulty Nonce Model
Graceful Security Faulty Nonce Mirror Theory
2019/2/27
Encrypt-then-MAC (EtM) is a popular mode for authenticated encryption (AE). Unfortunately, almost all designs following the EtM paradigm, including the AE suites for TLS, are vulnerable against nonce ...
libInterMAC: Beyond Confidentiality and Integrity in Practice
fragmentation attack SSH Authenticated Encryption
2019/2/25
Boldyreva et al. (Eurocrypt 2012) defined a fine-grained security model capturing ciphertext fragmentation attacks against symmetric encryption schemes. The model was extended by Albrecht et al. (CCS ...
Weak Zero-Knowledge Beyond the Black-Box Barrier
zero knowledge non-black-box techniques fully-homomorphic encryption
2018/11/9
The round complexity of zero-knowledge protocols is a long-standing open question, yet to be settled under standard assumptions. So far, the question has appeared equally challenging for relaxations s...
CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
Delegated Computation Homomorphic Signatures Context-Hiding
2018/6/19
Sensitive data is often outsourced to cloud servers, with the server performing computation on the data. Computational correctness must be efficiently verifiable by a third party while the input data ...
Generic Attacks against Beyond-Birthday-Bound MACs
Modes of operation Cryptanalysis Message Authentication Codes
2018/6/5
In this work, we study the security of several recent MAC constructions with provable security beyond the birthday bound. We consider block-cipher based constructions with a double-block internal stat...
Wide Tweakable Block Ciphers Based on Substitution-Permutation Networks: Security Beyond the Birthday Bound
substitution-permutation networks tweakable block ciphers domain extension of block ciphers
2018/5/28
Substitution-Permutation Networks (SPNs) refer to a family of constructions which build a wnwn-bit (tweakable) block cipher from nn-bit public permutations. Many widely deployed block ciphers are part...
Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC
EDMEDM EWCDMEWCDM Mirror Theory
2018/5/28
The international standard ISO/IEC 9797-1:2011 specifies six versions of MACs, called MAC Algorithm 1-6, and many of these MACs enjoy widespread use in practical applications. However, security guaran...