Results 81 to 90 of about 90,649 (207)
A Theoretical Framework for the Analysis of Physical Unclonable Function Interfaces and Its Relation to the Random Oracle Model [PDF]
, 2023 Marten van Dijk, Chenglu Jin
openalex +1 more source
Verifiable Random Functions (VRFs) [PDF]
, 2018 A Verifiable Random Function (VRF) is the public-key version of a keyed cryptographic hash. Only the holder of the private key can compute the hash, but anyone with public key can verify the correctness of the hash.
Goldberg, Sharon +3 more
core
Cryptanalysis and improvement of an efficient certificateless signature scheme
, 2008 In traditional digital signature schemes, certificates signed by a trusted party are required to ensure the authenticity of the public key. In Asiacrypt 2003, the concept of certificateless signature scheme was introduced.
Huang, Xinyi, Li, Jiguo, Mu, Yi, Wu, Wei
core +1 more source
A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM [PDF]
, 2017 Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of applications, in particular, as an essential building block for two-party and multi-party computation.
Barreto, Paulo S. L. M. +4 more
core +1 more source
Tongxin 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
Journal 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
Minimax-optimal Inference from Partial Rankings [PDF]
, 2014 This paper studies the problem of inferring a global preference based on the partial rankings provided by many users over different subsets of items according to the Plackett-Luce model.
Hajek, Bruce, Oh, Sewoong, Xu, Jiaming
core
Simulation-Based Secure Functional Encryption in the Random Oracle Model [PDF]
, 2015 One of the main lines of research in functional encryption FE has consisted in studying the security notions for FE and their achievability. This study was initiated by [Boneh et al. --- TCC'11, O'Neilli¾?--- ePrint'10] where it was first shown that for FE the indistinguishability-based IND security notion is not sufficient in the sense that there are ...
Iovino V., Zebroski K.
openaire +2 more sources
On Statistical Query Sampling and NMR Quantum Computing
, 2003 We introduce a ``Statistical Query Sampling'' model, in which the goal of an algorithm is to produce an element in a hidden set $Ssubseteqbit^n$ with reasonable probability.
Blum, Avrim, Yang, Ke
core +1 more source
Practical Lattice-Based Multisignature Schemes for Blockchains
IEEE Access, 2019 Compact multisignature is vital for shrinking the signature size of decentralized blockchain. All practical compact multisignature schemes have been constructed from the discrete logarithm problem which is potentially vulnerable to quantum computing ...
Changshe Ma, Mei Jiang
doaj +1 more source