搜索结果: 1-15 共查到“军事学 self”相关记录42条 . 查询时间(0.245 秒)
Crisis: Probabilistically Self Organizing Total Order in Unstructured P2P Networks
byzantine cryptocurrency bitcoin
2019/7/15
A framework for asynchronous, signature free, fully local and probabilistically converging total order algorithms is developed, that may survive in high entropy, unstructured Peer-to-Peer networks wit...
The slide attack is a powerful cryptanalytic tool which has the unusual property that it can break iterated block ciphers with a complexity that does not depend on their number of rounds. However, it ...
A Novel FPGA Architecture and Protocol for the Self-attestation of Configurable Hardware
FPGA configurable hardware remote attestation
2019/4/23
Field-Programmable Gate Arrays or FPGAs are popular platforms for hardware-based attestation. They offer protection against physical and remote attacks by verifying if an embedded processor is running...
Generic Hardness of Inversion on Ring and Its Relation to Self-Bilinear Map
MCDH unbalanced modulus
2018/5/22
In this paper, we study the generic hardness of the inversion problem on a ring, which is a problem to compute the inverse of a given prime cc by just using additions, subtractions and multiplications...
Self-Guarding Cryptographic Protocols against Algorithm Substitution Attacks
public-key private-key
2017/10/10
We put forward the notion of self-guarding cryptographic protocols as a countermeasure to algorithm substitution attacks. Such self-guarding protocols can prevent undesirable leakage by subverted algo...
An efficient self-blindable attribute-based credential scheme
anonymous credentials attribute-based credentials elliptic curve cryptosystem
2017/2/20
An attribute-based credential scheme allows a user, given a set of attributes, to prove ownership of these attributes to a verifier, voluntarily disclosing some of them while keeping the others secret...
On the Exact Round Complexity of Self-Composable Two-Party Computation
secure two-party computation concurrent security exact round complexity
2017/2/20
In contrast, round complexity of secure computation in the concurrent setting, where several protocols may run simultaneously, is poorly understood. Since standard polynomial time simulation is imposs...
CCA Security for Self-Updatable Encryption: Protecting Cloud Data When Clients Read/Write Ciphertexts
Public-key encryption Self-updatable encryption Chosen-ciphertext security
2016/1/27
Self-updatable encryption (SUE) is a new kind of public-key encryption, motivated by cloud computing,
which enables anyone (i.e. cloud server with no access to private keys) to update a past cipherte...
Self-Updatable Encryption with Short Public Parameters and Its Extensions
Public-key encryption Self-updatable encryption Ciphertext delegation
2016/1/23
Cloud storage is very popular since it has many advantages, but there is a new threat to cloud storage that was not considered before. Self-updatable encryption that updates a past ciphertext to a fu...
Fully Secure Self-Updatable Encryption in Prime Order Bilinear Groups
public-key encryption self-updatable encryption ciphertext update
2016/1/5
In CRYPTO 2012, Sahai et al. raised the concern that in a cloud control system revocation
of past keys should also be accompanied by updation of previously generated ciphertexts in
order to prevent ...
Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
self-bilinear map indistinguishability obfuscation multilinear map
2016/1/4
A self-bilinear map is a bilinear map where the domain and target groups are identical. In
this paper, we introduce a self-bilinear map with auxiliary information which is a weaker variant
of a self...
Remotely Managed Logic Built-In Self-Test for Secure M2M Communications
Logic Built-In Self-Test hardware Trojans M2M
2016/1/3
A rapid growth of Machine-to-Machine (M2M) communications is expected in the coming years. M2M applications create new challenges for in-field testing since they typically operate in environments wher...
Oblivious Transfer from weakly Random Self-Reducible Public-Key Cryptosystem
Oblivious Transfer Public-Key Cryptosystem
2015/12/31
In this work, we define a new notion of weakly Random-Self-Reducibile cryptosystems
and show how it can be used to implement secure Oblivious Transfer. We also show that
two recent (Post-quantum) cr...
On the Security of a Self-healing Group Key Distribution Scheme
Cryptanalysis forward security collusion resistance
2015/12/25
Recently, in Journal of Security and Communication Networks (5(12):1363-1374, DOI: 10.1002/
sec.429), Wang et al. proposed a group key distribution scheme with self-healing property for
wireless net...
The self-blindable U-Prove scheme by Hanzlik and Kluczniak is forgeable
anonymous credentials attribute-based credentials
2015/12/24
In [HK14] an unlinkable version of the U-Prove attribute-based credential scheme is proposed.
Unfortunately, the new scheme is forgeable: if sufficiently many users work together then they
can const...