搜索结果: 1-15 共查到“密码学 identification”相关记录54条 . 查询时间(0.14 秒)
Anonymous Deniable Identification in Ephemeral Setup & Leakage Scenarios
identification scheme ephemeral secret setting ephemeral secret leakage
font style='font-size:12px;'>
2019/4/3
In this paper we concern anonymous identification, where the verifier can check that the user belongs to a given group of users (just like in case of ring signatures), however a transcript of a sessio...
A Modular Treatment of Blind Signatures from Identification Schemes
Blind signature identification schemes Forking Lemma
font style='font-size:12px;'>
2019/3/6
We propose a modular security treatment of blind signatures derived from linear identification schemes in the random oracle model. To this end, we present a general framework that captures several wel...
Anonymous Distance-Bounding Identification
Distance-Bounding Anonymous Authentication Public-Key
font style='font-size:12px;'>
2018/4/19
Anonymous Distance-Bounding (DB) protocols allow a prover to convince a verifier that they are within a distance bound from them, without revealing their identity. This is an attractive property that ...
Directional Distance-Bounding Identification Protocols
Distance-Bounding Public-Key Authentication Directional Antenna
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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 ...
Zero-Knowledge Proxy Re-Identification Revisited
ZK-PRI PRS
font style='font-size:12px;'>
2017/2/20
Zero-knowledge proxy re-identification (ZK-PRI) has been introduced by Blaze et al. in 1998 together with two other well known primitives of recryptography, namely proxy re-encryption (PRE) and proxy ...
From 5-pass MQ-based identification to MQ-based signatures
post-quantum cryptography Fiat-Shamir 5-pass identification scheme
font style='font-size:12px;'>
2016/7/20
This paper presents MQDSS, the first signature scheme with a security reduction based on the problem of solving a multivariate system of quadratic equations (MQ problem). In order to construct this sc...
Catching MPC Cheaters: Identification and Openability
cryptographic protocols multi-party computation
font style='font-size:12px;'>
2016/6/15
Secure multi-party computation (MPC) protocols do not completely prevent malicious parties from cheating and disrupting the computation. A coalition of malicious parties can repeatedly cause the compu...
Optimal Security Proofs for Signatures from Identification Schemes
Signatures Identification Schnorr tightness
font style='font-size:12px;'>
2016/2/24
We perform a concrete security treatment of digital signature schemes obtained from canonical
identification schemes via the Fiat-Shamir transform. If the identification scheme is rerandomizable
and...
When are Identification Protocols with Sparse Challenges Safe? The Case of the Coskun and Herley Attack
Identification protocols human identification protocols cryptography
font style='font-size:12px;'>
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 ...
Security Attack on CloudBI: Practical privacy-preserving outsourcing of biometric identification in the cloud
cryptographic protocols cryptanalysis
font style='font-size:12px;'>
2016/1/26
In ESORICS 2015, Wang et al. proposed a privacy-preserving outsourcing design for biometric identification using public cloud platforms, namely CloudBI. CloudBI introduces two designs: CloudBI-I and C...
Implementation and Comparison of Lattice-based Identification Protocols on Smart Cards and Microcontrollers
Smart Card Implementation Lattice-based Cryptography Post-quantum Cryptography
font style='font-size:12px;'>
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...
Secure and Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification
private fingerprint authentication oblivious algorithm maximum flow
font style='font-size:12px;'>
2016/1/8
The increasing availability and use of biometric data for authentication and other purposes
leads to situations when sensitive biometric data is to be handled or used in computation by
entities who ...
Algebraic Attacks on Human Identification Protocols
Human identification protocols linear system of congruences learning with errors
font style='font-size:12px;'>
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...
Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage
Leakage Resilience Bounded Retrieval Model Proof of Storage
font style='font-size:12px;'>
2015/12/22
We provide a framework for constructing leakage-resilient identification (ID) protocols in
the bounded retrieval model (BRM) from proofs of storage (PoS) that hide partial information
about the file...