Cryptanalysis of a Lightweight Certificateless Signature Scheme for IIOT Environments
IEEE Access, 2018 As an extremely significant cryptographic primitive, certificateless signature (CLS) schemes can provide message authentication with no use of traditional digital certificates.
Bo Zhang +3 more
doaj +1 more source
Distribution-Aware Sampling and Weighted Model Counting for SAT [PDF]
, 2014 Given a CNF formula and a weight for each assignment of values to variables, two natural problems are weighted model counting and distribution-aware sampling of satisfying assignments. Both problems have a wide variety of important applications.
Chakraborty, Supratik +4 more
core +4 more sources
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model [PDF]
, 2019 20 ...
Christian Majenz +5 more
openaire +4 more sources
Security of discrete log cryptosystems in the random oracle and the generic model [PDF]
, 1999 We introduce novel security proofs that use combinatorial counting arguments rather than reductions to the discrete logarithm or to the Diffie-Hellman problem. Our security results are sharp and clean with no polynomial reduction times involved.
Jakobsson, Markus, Schnorr, Claus Peter
core
TumbleBit: an untrusted Bitcoin-compatible anonymous payment hub [PDF]
, 2017 This paper presents TumbleBit, a new unidirectional unlinkable payment hub that is fully compatible with today s Bitcoin protocol. TumbleBit allows parties to make fast, anonymous, off-blockchain payments through an untrusted intermediary called the ...
AlShenibr, Leen +4 more
core +2 more sources
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles [PDF]
, 2015 The Fiat-Shamir (FS) transform is a popular technique for obtaining practical zero-knowledge argument systems. The FS transform uses a hash function to generate, without any further overhead, non-interactive zero-knowledge (NIZK) argument systems from ...
Ciampi, Michele +3 more
core +2 more sources
Security analysis and improvement of a certificateless signcryption scheme
Tongxin xuebao, 2015 To solve the certificate management problem in the traditional public key cryptography and the key escrow problem in the identity-based public key cryptography, Al-Riyami and Paterson proposed the concept of the certificateless public key cryptography ...
Zhen-guo ZHAO
doaj +2 more sources
Permutation-Based Hash Chains with Application to Password Hashing
IACR Transactions on Symmetric CryptologyHash chain based password systems are a useful way to guarantee authentication with one-time passwords. The core idea dates back to Lamport, and is specified in RFC 1760 as S/Key. At CCS 2017, Kogan et al.
Charlotte Lefevre, Bart Mennink
doaj +1 more source
A Ring-LWE-based digital signature inspired by Lindner–Peikert scheme
Journal of Mathematical Cryptology, 2022 In this article, we give a digital signature by using Lindner–Peikert cryptosystem. The security of this digital signature is based on the assumptions about hardness of Ring-LWE and Ring-SIS problems, along with providing public key and signature of ...
Sharafi Javad, Daghigh Hassan
doaj +1 more source
Empirical entropy, minimax regret and minimax risk
, 2017 We consider the random design regression model with square loss. We propose a method that aggregates empirical minimizers (ERM) over appropriately chosen random subsets and reduces to ERM in the extreme case, and we establish sharp oracle inequalities ...
Rakhlin, Alexander +2 more
core +1 more source