搜索结果: 1-15 共查到“军队指挥学 Breaking”相关记录60条 . 查询时间(0.093 秒)
Breaking and Fixing Anonymous Credentials for the Cloud (Full Version)
Attribute-based credentials Privacy-preserving authentication Strong authentication
2019/9/23
In an attribute-based credential (ABC) system, users obtain a digital certificate on their personal attributes, and can later prove possession of such a certificate in an unlinkable way, thereby selec...
Breaking the Bluetooth Pairing – The Fixed Coordinate Invalid Curve Attack
Bluetooth elliptic curve cryptosystem Diffie-Hellman
2019/9/19
Bluetooth is a widely deployed standard for wireless communications between mobile devices. It uses authenticated Elliptic Curve Diffie-Hellman for its key exchange. In this paper we show that the aut...
Breaking the Lightweight Secure PUF: Understanding the Relation of Input Transformations and Machine Learning Resistance
Physically Unclonable Function Machine Learning Modelling Attack
2019/7/15
Physical Unclonable Functions (PUFs) and, in particular, XOR Arbiter PUFs have gained much research interest as an authentication mechanism for embedded systems. One of the biggest problems of (strong...
Breaking Tweakable Enciphering Schemes using Simon's Algorithm
TES Simon's algorithm Quantum period finding algorithm
2019/6/19
The threat of the possible advent of quantum computers has motivated the cryptographic community to search for quantum safe solutions. There have been some works in past few years showing the vulnerab...
Assuring security of the Internet of Things (IoT) is much more challenging than assuring security of centralized environments, like the cloud. A reason for this is that IoT devices are often deployed ...
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir
TFNP PPAD Nash Equilibrium
2019/5/23
The Fiat-Shamir heuristic transforms a public-coin interactive proof into a non-interactive argument, by replacing the verifier with a cryptographic hash function that is applied to the protocol’s tra...
One Fault is All it Needs: Breaking Higher-Order Masking with Persistent Fault Analysis
fault attacks masking persistent
2019/1/9
Persistent fault analysis (PFA) was proposed at CHES 2018 as a novel fault analysis technique. It was shown to completely defeat standard redundancy based countermeasure against fault analysis. In thi...
Breaking the Binding: Attacks on the Merkle Approach to Prove Liabilities and its Applications
proof of liabilities Maxwell protocol summation Merkle tree
2018/11/30
Proofs of liabilities are used for applications, function like banks or Bitcoin exchanges, to prove the sums of money in their dataset that they should owe. The Maxwell protocol, a cryptographic proof...
OCB2 is a widely standardized mode of operation of a blockcipher that aims at providing authenticated encryption. A recent report by Inoue and Minematsu (IACR EPRINT report 2018/1040) indicates that O...
Breaking a Lightweight M2M Authentication Protocol for Communications in IIoT Environment
M2M communications IIoT Authentication
2018/11/9
The concept of the Industrial Internet of Things (IIoT) can be defined as the integration of smart sensor networks and the Internet of Things (IoT). This technology can be employed in various industri...
Breaking Message Integrity of an End-to-End Encryption Scheme of LINE
E2EE LINE key exchange
2018/7/16
In this paper, we analyze the security of an end-to-end encryption scheme (E2EE) of LINE, a.k.a Letter Sealing. LINE is one of the most widely-deployed instant messaging applications, especially in Ea...
We study secret sharing schemes for general (non-threshold) access structures. A general secret sharing scheme for nn parties is associated to a monotone function F:{0,1}n→{0,1}F:{0,1}n→{0,1}. In such...
How Far Can We Reach? Breaking RSM-Masked AES-128 Implementation Using Only One Trace
Side Channel Attacks Template Attack DPA Contest
2017/11/28
Rotating Sbox Masking (RSM) scheme is a lightweight and highly efficient first-order masking scheme proposed to protect cryptographic implementations like AES from side channel attacks. It is a Low En...
Towards Breaking the Exponential Barrier for General Secret Sharing
Exponential Barrier General Secret Sharing
2017/11/10
A secret-sharing scheme for a monotone Boolean (access) function F:{0,1}n→{0,1}F:{0,1}n→{0,1} is a randomized algorithm that on input a secret, outputs nn shares s1,…,sns1,…,sn such that for any (x1,…...
Ed25519 is an instance of the Elliptic Curve based signature scheme EdDSA that was recently introduced to solve an inconvenience of the more established ECDSA. Namely, both schemes require the generat...