Results 231 to 240 of about 179,893 (274)
Elevated Connectivity During Language Processing Is Associated With Cognitive Performance in SeLECTS
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Self‐Limited Epilepsy with Centrotemporal Spikes (SeLECTS) is associated with language impairments despite seizures originating in the motor cortex, suggesting aberrant cross‐network interactions. Here we tested whether functional connectivity in SeLECTS during language tasks predicts language performance.
Wendy Qi +8 more
wiley +1 more source
A scalable post quantum secure blockchain framework with adaptive time consensus in cloud environments. [PDF]
Sci RepVelmurugan M, Kumar MR.
europepmc +1 more source
Forensics System for Internet of Vehicles Based on Post-Quantum Blockchain. [PDF]
Sensors (Basel)Zhang Z, Cao Z, Wang Y.
europepmc +1 more source
SRAM based Gaussian noise generation for post quantum cryptography. [PDF]
Sci RepKim MS, Jeon SB, Kim S.
europepmc +1 more source
Quantum cryptography and data protection for medical devices before and after they meet Q-Day. [PDF]
NPJ Digit MedFreyer O +3 more
europepmc +1 more source
The State of Practice About Security in Telemedicine Systems in Chile: Exploratory Study.
JMIR Med InformMarquez G +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Computing, 1991
The property of nonmalleability for the encryption function \(E\) is a stronger extension of the classic notion of semantic security that was introduced by Goldwasser and Micali. This property is defined as follows. For all polynomial-time computable relations \(R\) seeing \(\alpha\in E(x)\) does not help one to find \(\beta\in E(y)\), \(\beta\neq ...
Dolev, Danny, Dwork, Cynthia, Naor, Moni
openaire +2 more sources
The property of nonmalleability for the encryption function \(E\) is a stronger extension of the classic notion of semantic security that was introduced by Goldwasser and Micali. This property is defined as follows. For all polynomial-time computable relations \(R\) seeing \(\alpha\in E(x)\) does not help one to find \(\beta\in E(y)\), \(\beta\neq ...
Dolev, Danny, Dwork, Cynthia, Naor, Moni
openaire +2 more sources
European Transactions on Telecommunications, 1994
AbstractIn the traditional scenario in cryptography there is one sender, one receiver and an active or passive eavesdropper who is an opponent. Large bank transactions require two people to sign, implying two senders. So the power to generate a valid transaction is shared.
openaire +1 more source
AbstractIn the traditional scenario in cryptography there is one sender, one receiver and an active or passive eavesdropper who is an opponent. Large bank transactions require two people to sign, implying two senders. So the power to generate a valid transaction is shared.
openaire +1 more source
Scientific American
The science of cryptography lies at the very foundations of trust in current and future systems and devices for communication and computation. For example, secure communications over the internet today are possible thanks to mathematical work in cryptography in the 1970s and 80s.
Johannes Buchmann +3 more
+5 more sources
The science of cryptography lies at the very foundations of trust in current and future systems and devices for communication and computation. For example, secure communications over the internet today are possible thanks to mathematical work in cryptography in the 1970s and 80s.
Johannes Buchmann +3 more
+5 more sources