Results 211 to 220 of about 49,332 (258)
Next-Generation Harvester Technologies: Synergizing Smart Grading and Biomechanical Damage Control in Mechanized Tomato Production. [PDF]
Sensors (Basel)Jing J +6 more
europepmc +1 more source
A dynamic policy-aware conditional proxy re-encryption system for fine-grained access control in IoT pub/sub systems. [PDF]
Sci RepLin S, Ke N, Jun Ru H, Cui L.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Collision Resistance of the OAM-based Quantum Hashing
Lobachevskii Journal of Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Vasiliev
openaire +3 more sources
On Distributional Collision Resistant Hashing
2018Collision resistant hashing is a fundamental concept that is the basis for many of the important cryptographic primitives and protocols. Collision resistant hashing is a family of compressing functions such that no efficient adversary can find any collision given a random function in the family.
Ilan Komargodski, Eylon Yogev
openaire +2 more sources
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
2018A collision resistant hash (CRH) function is one that compresses its input, yet it is hard to find a collision, i.e. a \(x_1 \ne x_2\) s.t. \(h(x_1) = h(x_2)\). Collision resistant hash functions are one of the more useful cryptographic primitives both in theory and in practice and two prominent applications are in signature schemes and succinct zero ...
Ilan Komargodski, Moni Naor, Eylon Yogev
openaire +2 more sources
Generic Groups, Collision Resistance, and ECDSA
Designs, Codes and Cryptography, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Generalized Compact Knapsacks Are Collision Resistant
2006In (Micciancio, FOCS 2002), it was proved that solving the generalized compact knapsack problem on the average is as hard as solving certain worst-case problems for cyclic lattices. This result immediately yielded very efficient one-way functions whose security was based on worst-case hardness assumptions. In this work, we show that, while the function
Vadim Lyubashevsky, Daniele Micciancio
openaire +2 more sources
Atom Collision-Induced Resistivity of Carbon Nanotubes
Science, 2005We report the observation of unusually strong and systematic changes in the electron transport in metallic single-walled carbon nanotubes that are undergoing collisions with inert gas atoms or small molecules. At fixed gas temperature and pressure, changes in the resistance and thermopower of thin films are observed that scale as roughly
Hugo E, Romero +3 more
openaire +2 more sources
Collision Resistant Double-Length Hashing
2010We give collision resistance bounds for blockcipher based, double-call, double-length hash functions using (k, n)-bit blockciphers with k > n. Ozen and Stam recently proposed a framework [21] for such hash functions that use 3n-to-2n-bit compression functions and two parallel calls to two independent blockciphers with 2n-bit key and n-bit block size.
Ewan Fleischmann +3 more
openaire +1 more source