搜索结果: 1-15 共查到“Revisiting”相关记录120条 . 查询时间(0.187 秒)
学术报告-Revisiting Graph Convolutional Networks: From Paradigm to Application(图)
学术报告 图神经网络 王石平
2024/4/15
Revisiting the Hybrid attack on sparse and ternary secret LWE
Lattice-based Cryptography Learning with Errors Homomorphic Encryption
2019/9/16
In the practical use of the Learning With Error (LWE) based cryptosystems, it is quite common to choose the secret to be extremely small: one popular choice is ternary (±1,0±1,0) coefficient vector, a...
Prime, Order Please! Revisiting Small Subgroup and Invalid Curve Attacks on Protocols using Diffie-Hellman
formal verification symbolic model tamarin prover
2019/5/21
Diffie-Hellman groups are a widely used component in cryptographic protocols in which a shared secret is needed. These protocols are typically proven to be secure under the assumption they are impleme...
Revisiting Privacy-aware Blockchain Public Key Infrastructure
Blockchain Public Key Infrastructure Privacy
2019/5/21
Privacy-aware Blockchain Public Key Infrastructure (PB- PKI) is a recent proposal by Louise Axon (2017) to create a privacy-preserving Public Key Infrastructure on the Blockchain. However, PB-PKI suff...
Revisiting Privacy-aware Blockchain Public Key Infrastructure
Blockchain Public Key Infrastructure Privacy
2019/5/21
Privacy-aware Blockchain Public Key Infrastructure (PB- PKI) is a recent proposal by Louise Axon (2017) to create a privacy-preserving Public Key Infrastructure on the Blockchain. However, PB-PKI suff...
Revisiting Location Privacy from a Side-Channel Analysis Viewpoint (Extended Version)
side-channel analysis location privacy
2019/5/13
Inspired by the literature on side-channel attacks against cryptographic implementations, we describe a framework for the analysis of location privacy. It allows us to revisit (continuous) re-identifi...
Revisiting Post-Compromise Security Guarantees in Group Messaging
post-compromise security forward secrecy group messaging protocols
2019/5/13
Modern secure messaging protocols such as Signal can offer strong security guarantees, in particular Post-Compromise Security (PCS). The core PCS mechanism in these protocols is inherently pairwise, w...
Location, location, location: Revisiting modeling and exploitation for location-based side channel leakages
Side-channel analysis location leakage microprobe
2019/3/4
Near-field microprobes have the capability to isolate small regions of a chip surface and enable precise measurements with high spatial resolution. Being able to distinguish the activity of small regi...
Let σσ be some positive integer and C⊆{(i,j):1≤iind finding a lower bound on the number of distinct blocks P1,…,Pσ∈{0,1}nP1,…,Pσ∈{0,1}n satisfying a s...
Revisiting Orthogonal Lattice Attacks on Approximate Common Divisor Problems and their Applications
Fully homomorphic encryption approximate common divisor problem implicit factorization problem
2018/12/20
In this paper, we revisit three existing types of orthogonal lattice (OL) attacks and propose optimized cases to solve approximate common divisor (ACD) problems. In order to reduce both space and time...
In this paper we revisit some of the main aspects of the DAGS Key Encapsulation Mechanism, one of the code-based candidates to NIST's standardization call for the key exchange/encryption functionaliti...
A threshold secret sharing scheme (with threshold tt) allows a dealer to share a secret among a set of parties such that any group of tt or more parties can recover the secret and no group of at most ...
Applications of H-Technique: Revisiting Symmetric Key Security Analysis
provable security coefficients H technique Feistel
2018/11/29
The Coefficients H Technique (also called H-technique), by Patarin, is a tool to obtain upper bound on the distinguishing advantage. The tool is known for providing quite simpler and tight bound proof...
Revisiting Key-alternating Feistel Ciphers for Shorter Keys and Multi-user Security
blockcipher provable security multi-user security
2018/11/19
Our results hold in the multi-user setting as well, constituting the first non-trivial multi-user provable security results on Feistel ciphers. We finally demonstrate applications of our results on de...
Revisiting Single-server Algorithms for Outsourcing Modular Exponentiation
modular exponentiations secure outsourcing
2018/11/2
We investigate the problem of securely outsourcing modular exponentiations to a single, malicious computational resource. We revisit recently proposed schemes using single server and analyse them agai...