Results 81 to 90 of about 14,997,530 (270)

Provably secure and efficient certificateless sequential multi-signature scheme in random oracle model

open access: yesTongxin xuebao, 2014
Certificate less sequential multi-signature scheme could resolve the problem of authentication of recommendation information transmitted through trust train.Qin yan-lin,et al proposed an efficient certificateless sequential multi-signature scheme,and ...
Yan XU   +3 more
doaj   +2 more sources

A Machine-Checked Formalization of the Generic Model and the Random Oracle Model [PDF]

open access: yes, 2004
Most approaches to the formal analyses of cryptographic protocols make the perfect cryptography assumption, i.e. the hypothese that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key. Ideally, one would prefer to rely on a weaker hypothesis on the computational cost of gaining information about ...
Gilles Barthe   +2 more
openaire   +2 more sources

Digging Deep: Dynamic Programming for Optimal Routing With Double‐Deep Autonomous Mobile Robot Picking

open access: yesNetworks, EarlyView.
ABSTRACT Multi‐tote autonomous mobile robots (MT‐AMRs) are an emerging warehousing technology in which a mobile drive unit carries a lift‐based storage‐and‐retrieval mechanism with an extendable fork and a multi‐tote onboard buffer. On autonomous picking tours, an MT‐AMR visits storage locations, extracts product totes from racks, stores them in its ...
Nils Boysen, Fabian Hennig, Tobias Kroll
wiley   +1 more source

Multi-User Security Bound for Mixed Filter Permutators in the Random Oracle Model

open access: yesIACR Transactions on Symmetric Cryptology
At Eurocrypt’16, Méaux et al. designed a construction for symmetric ciphers that can be efficiently evaluated with Fully Homomorphic Encryption, dubbed Filter Permutator. They also specify FLIP, a family of Filter Permutators.
Benoît Cogliati, Simon Demarty
doaj   +1 more source

Certificateless

open access: yesJournal of King Saud University: Computer and Information Sciences, 2014
The concept of aggregate signcryption was first introduced in 2009 by Selvi et al. [Identity based aggregate signcryption schemes, Lecture Notes in Computer Science 5922 LNCS, 2009, pp. 378–397].
Ziba Eslami, Nasrollah Pakniat
doaj   +1 more source

Lifestyle medicine innovations: Physical activity assessment in patient care and implementation of a digital health platform to support healthier movement

open access: yesPM&R, EarlyView.
Abstract Objective To introduce the ExerciseRxTM digital health platform as a scalable approach to support personalized physical activity (PA) and home exercise as part of clinical care. Design Narrative review of Physical Activity Vital Sign (PAVS) integration within an academic healthcare system as well as description and ongoing research on a ...
Cindy Y. Lin, Theresa Kehne
wiley   +1 more source

Double-sided: tight proofs for guessing games in the quantum random oracle model

open access: yesCybersecurity
The semi-classical One-Way to Hiding (SC-O2H) lemma given by Ambainis et al. (CRYPTO 2019) is a crucial technique to solve the reprogramming problem in the quantum random oracle model (QROM), which can lead to quadratically better bounds for many cases ...
Jiawei Bao, Jiangxia Ge, Rui Xue
doaj   +1 more source

Special Soundness in the Random Oracle Model

open access: yesIACR Communications in Cryptology
We generalize the optimal knowledge extractor for constant-round special sound protocols presented by Wikström (2018) to a knowledge extractor for the corresponding non-interactive Fiat-Shamir proofs in the random oracle model and give an exact analysis of the extraction error and running time.
openaire   +3 more sources

On the Relation Between the Ideal Cipher and the Random Oracle Models [PDF]

open access: yes, 2006
The Random Oracle Model and the Ideal Cipher Model are two of the most popular idealized models in cryptography. It is a fundamentally important practical and theoretical problem to compare the relative strengths of these models and to see how they relate to each other. Recently, Coron et al. [8] proved that one can securely instantiate a random oracle
Yevgeniy Dodis, Prashant Puniya
openaire   +2 more sources

The Random Oracle Methodology, Revisited [PDF]

open access: yes, 2003
We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called cryptographic hash functions .
Ran Canetti, Shai Halevi, Oded Goldreich
core  

Home - About - Disclaimer - Privacy