搜索结果: 1-7 共查到“军事学 identification protocols”相关记录7条 . 查询时间(0.206 秒)
Directional Distance-Bounding Identification Protocols
Distance-Bounding Public-Key Authentication Directional Antenna
2018/4/19
Distance bounding (DB) protocols allow a prover to convince a verifier that they are within a distance bound. A public key distance bounding relies on the public key of the users to prove their identi...
Tightly-Secure Signatures from Five-Move Identification Protocols
Signatures Five-Move Identification Protocols Fiat-Shamir
2017/9/14
We carry out a concrete security analysis of signature schemes obtained from five-move identification protocols via the Fiat-Shamir transform. Concretely, we obtain tightly-secure signatures based on ...
When are Identification Protocols with Sparse Challenges Safe? The Case of the Coskun and Herley Attack
Identification protocols human identification protocols cryptography
2016/1/26
Cryptographic identification protocols enable a prover to prove its identity to a
verifier. A subclass of such protocols are shared-secret challenge-response identifi-
cation protocols in which the ...
Implementation and Comparison of Lattice-based Identification Protocols on Smart Cards and Microcontrollers
Smart Card Implementation Lattice-based Cryptography Post-quantum Cryptography
2016/1/26
Most lattice-based cryptographic schemes which enjoy a security proof
suffer from huge key sizes and heavy computations. This is also true for the simpler
case of identification protocols. Recent pr...
Algebraic Attacks on Human Identification Protocols
Human identification protocols linear system of congruences learning with errors
2016/1/7
Human identification protocols are challenge-response protocols that rely on human computational
ability to reply to random challenges from the server based on a public function of a shared
secret a...
Two identification protocols based on Cayley graphs of Coxeter groups
Authentication Coxeter groups identification protocols random spanning trees word problem
2010/9/9
A challenge-response identification protocol is introduced, based on the intractability of the word problem in some Coxeter groups. A Prover builds his public key as the set of leaves of a tree in the...
We provide identification protocols that are secure even when the adversary can reset the internal state and/or randomization source of the user identifying itself, and when executed in an asynchronou...