Results 221 to 230 of about 27,441 (278)

A secure and efficient user selection scheme in vehicular crowdsensing. [PDF]

Sci Rep
Zhang M, Ye Q, Yuan Z, Deng K.
europepmc   +1 more source

Categorical framework for quantum-resistant zero-trust AI security. [PDF]

Sci Rep
Cherkaoui I, Clarke C, Horgan J, Dey I.
europepmc   +1 more source

From discovery to delivery: a systems-based pathway for translating science into global and humanitarian health impact. [PDF]

Confl Health
Ramalingam B.
europepmc   +1 more source

Assessing the Evolution and Influence of Medical Open Databases on Biomedical Research and Health Care Innovation: A 25-Year Perspective With a Focus on Privacy and Privacy-Enhancing Technologies.

J Med Internet Res
Yang A, Pan ML, Lu HH, Lien CY, Wang DW, Chen CH, Tarng DC, Niu DM, Chiou SH, Wu CY, Sun YC, Chen SA, Wang SJ, Sheu WH, Lin CH.   +14 more
europepmc   +1 more source

Secure quantum-resilient smart city communication networks using QSC-Net with MF-MBO-based energy-aware task scheduling. [PDF]

Sci Rep
Reddy NR, Dalton GA, Swathi K, Subrahmanyam DVSS, G LK, Nagaraju G.   +5 more
europepmc   +1 more source

Security Authentication Scheme for Vehicle-to-Everything Computing Task Offloading Environments. [PDF]

Sensors (Basel)
Liu Y, Li C, Sun Q, Jiang H.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Provably Secure (Broadcast) Homomorphic Signcryption

International Journal of Foundations of Computer Science, 2019
Signcryption has drawn a lot of attention due to its useful applications in many areas, in particular for applications where the computation and communication resources are constrained, for example, for lightweight devices. The traditional signcryption scheme does not support the homomorphic property. Recent work by Rezaeibagha et al.
Rezaeibagha, Fatemeh, Mu, Yi, Zhang, Shiwei, Wang, Xiaofen   +3 more
openaire   +3 more sources

Provably Secure Encryption

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
Hans Delfs, Helmut Knebl
openaire   +1 more source