Results 271 to 280 of about 26,946 (315)
Challenges of identification and anonymity in time-continuous data from medical environments. [PDF]
Hammer F, Strufe T.
europepmc +1 more source
Secure and Lightweight Cluster-Based User Authentication Protocol for IoMT Deployment. [PDF]
Su X, Xu Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2002
This chapter deals with provable security. It is desirable that mathematical proofs show that a given cryptosystem resists certain types of attacks. The security of cryptographic schemes and randomness are closely related. An encryption method provides secrecy only if the ciphertexts appear sufficiently random to the adversary. Therefore, probabilistic
Helmut Knebl, Hans Delfs
openaire +2 more sources
This chapter deals with provable security. It is desirable that mathematical proofs show that a given cryptosystem resists certain types of attacks. The security of cryptographic schemes and randomness are closely related. An encryption method provides secrecy only if the ciphertexts appear sufficiently random to the adversary. Therefore, probabilistic
Helmut Knebl, Hans Delfs
openaire +2 more sources
Provable Security Analysis of FIDO2
2021We carry out the first provable security analysis of the new FIDO2 protocols, the promising FIDO Alliance’s proposal for a standard for passwordless user authentication. Our analysis covers the core components of FIDO2: the W3C’s Web Authentication (WebAuthn) specification and the new Client-to-Authenticator Protocol (CTAP2).
Shan Chen +3 more
openaire +2 more sources
Provably Secure Digital Signatures
2002In previous sections we discussed signature schemes (PSS and PSS-R in Section 3.4.3; the Fiat-Shamir signature scheme in Section 4.2.5) that include a hash function h and whose security can be proven in the random oracle model. It is assumed that the hash function h is a random oracle, i.e. it behaves like a perfectly random function.
Helmut Knebl, Hans Delfs
openaire +2 more sources
Provably Secure Homomorphic Signcryption
2017Signcryption has shown many useful applications, in particular for the environment where the computation and communication resources are constrained, for instance, for applications on lightweight devices. However, we notice that traditional signcryption schemes do not support homomorphic properties, which are very useful in many application scenarios ...
Fatemeh Rezaeibagha +4 more
openaire +3 more sources
Provably Secure Identity Based Provable Data Possession
2015Provable Data Possession PDP, which enables cloud users to verify the integrity of their outsourced data without retrieving the entire file from cloud servers, is highly essential in secure cloud storage. A majority of the existing PDP schemes rely on the expensive Public Key Infrastructure PKI.
Yu, Yong +4 more
openaire +3 more sources

