Results 161 to 170 of about 5,463 (216)

Research on key technologies for privacy-preserving, regulatorily compliant, and cross-chain interoperability in heterogeneous blockchain systems. [PDF]

Sci Rep
Chen Z, Liu H, Zhang L, Dai B, Shi Y.
europepmc   +1 more source

Performance Evaluation of zk-SNARK Protocols for Privacy-Preserving Sensor Data Verification: A Systematic Benchmarking Study. [PDF]

Sensors (Basel)
Kuznetsov O, Kuznetsova Y, Ziyatbekova G, Kovalenko Y, Palahusynets R.   +4 more
europepmc   +1 more source

Improving IoT Cybersecurity Performance with Lifecycle-Motivated Bit-Manipulation Compiler Optimizations. [PDF]

Sensors (Basel)
Budiul A, Pungilă C.
europepmc   +1 more source

SSDBFAN: Scalable and Secure Cluster-Based Data Aggregation with Blockchain for Flying Ad Hoc Networks. [PDF]

Sensors (Basel)
Majmaie SA, Ghajari G, Bhatta NP, Ibrahem MI, Amsaad F.   +4 more
europepmc   +1 more source

Single-photon advantage in quantum cryptography beyond QKD. [PDF]

Nat Commun
Vajner DA, Kaymazlar K, Drauschke F, Rickert L, von Helversen M, Liu H, Li S, Ni H, Niu Z, Pappa A, Heindel T.   +10 more
europepmc   +1 more source

Blockchain-driven smart contract with key exchange protocol for secure device-to-device communication using verkle tree K-ary structures. [PDF]

Sci Rep
Simbu A, Nandakumar S, Saravanan K.
europepmc   +1 more source

A secure group-based authentication protocol for IoVT in 5G-enabled smart transportation and road safety systems. [PDF]

Sci Rep
Singh G, Sharma S, Saudagar AKJ, Kumar S.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Cryptographic protocols

Proceedings of the fourteenth annual ACM symposium on Theory of computing, 1982
A cryptographic transformation is a mapping f from a set of cleartext messages, M, to a set of ciphertext messages. Since for m e M, f(m) should hide the contents of m from an enemy, f-1 should, in a certain technical sense, be difficult to infer from f(m) and public knowledge about f.
Richard A. DeMillo, Nancy A. Lynch, Michael Merritt   +2 more
openaire   +1 more source

Stateless Cryptographic Protocols

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Secure computation protocols inherently involve multiple rounds of interaction among the parties where, typically a party has to keep a state about what has happened in the protocol so far and then \emph{wait} for the other party to respond. We study if this is inherent. In particular, we study the possibility of designing cryptographic protocols where
Vipul Goyal, Hemanta K. Maji
openaire   +1 more source