Results 1 to 10 of about 1,707,394 (241)

DAGS: Key encapsulation using dyadic GS codes

Journal of Mathematical Cryptology, 2018
Code-based cryptography is one of the main areas of interest for NIST’s Post-Quantum Cryptography Standardization call. In this paper, we introduce DAGS, a Key Encapsulation Mechanism (KEM) based on quasi-dyadic generalized Srivastava codes.
Banegas Gustavo, Barreto Paulo S. L. M., Boidje Brice Odilon, Cayrel Pierre-Louis, Dione Gilbert Ndollane, Gaj Kris, Gueye Cheikh Thiécoumba, Haeussler Richard, Klamti Jean Belo, N’diaye Ousmane, Nguyen Duc Tri, Persichetti Edoardo, Ricardini Jefferson E.   +12 more
doaj   +1 more source

A New Short Signature Scheme with Random Oracle from Bilinear Pairings

Journal of Telecommunications and Information Technology, 2023
In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is constructed by bilinear inverse-square Diffie-Hellman problem (BISDHP) and does not require any special hash function.
Sedat Akleylek, Barıs ̧ B ̈ulent Kırlar, Omer Sever, Zaliha Y ̈uce   +3 more
doaj   +1 more source

Quantum Merkle Trees [PDF]

Quantum
Committing to information is a central task in cryptography, where a party (typically called a prover) stores a piece of information (e.g., a bit string) with the promise of not changing it.
Lijie Chen, Ramis Movassagh
doaj   +1 more source

An ID-Based Linearly Homomorphic Signature Scheme and Its Application in Blockchain

IEEE Access, 2018
Identity-based cryptosystems mean that public keys can be directly derived from user identifiers, such as telephone numbers, email addresses, and social insurance number, and so on.
Qun Lin, Hongyang Yan, Zhengan Huang, Wenbin Chen, Jian Shen, Yi Tang   +5 more
doaj   +1 more source

ID-based transitive signature schemes without random oracle

Tongxin xuebao, 2010
Based on waters’ signature scheme,the first identity-based transitive signature scheme was proposed and proved secure against attacks in the standard model.Compared with current transitive signature schemes,the unforgeability of the signature’s ...
MA Xiao-long1, GU Li-ze1, CUI Wei4, YANG Yi-xian1, HU Zheng-ming1   +4 more
doaj   +2 more sources

Practically secure quantum position verification

New Journal of Physics, 2021
We discuss quantum position verification (QPV) protocols in which the verifiers create and send single-qubit states to the prover. QPV protocols using single-qubit states are known to be insecure against adversaries that share a small number of entangled
Siddhartha Das, George Siopsis
doaj   +1 more source

Certificateless signature scheme without random oracles

Tongxin xuebao, 2015
The security of certificateless signature schemes can be proved under the random oracle model.However，any implementation of the random oracle may result in insecure schemes.Some certificateless signature schemes without random oracles are not secure ...
Yan-qiong LI, Ji-guo LI, Yi-chen ZHANG
doaj   +2 more sources

Oracle inequalities for weighted group lasso in high-dimensional misspecified Cox models

Journal of Inequalities and Applications, 2020
We study the nonasymptotic properties of a general norm penalized estimator, which include Lasso, weighted Lasso, and group Lasso as special cases, for sparse high-dimensional misspecified Cox models with time-dependent covariates.
Yijun Xiao, Ting Yan, Huiming Zhang, Yuanyuan Zhang   +3 more
doaj   +1 more source

Oblivious Transfer Based on NTRUEncrypt

IEEE Access, 2018
Oblivious transfer (OT) is the most fundamental process in cryptosystems and serves as the basic building block for implementing protocols, such as the secure multi-party computation and the fair electronic contract.
Bo Mi, Darong Huang, Shaohua Wan, Libo Mi, Jianqiu Cao   +4 more
doaj   +1 more source

Quantum Security of a Compact Multi-Signature

Cryptography
With the rapid advances in quantum computing, quantum security is now an indispensable property for any cryptographic system. In this paper, we study how to prove the security of a complex cryptographic system in the quantum random oracle model. We first
Shaoquan Jiang
doaj   +1 more source