Results 21 to 30 of about 106,354 (248)
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 +3 more
doaj +1 more source
, 2021 Ziel dieser Arbeit ist es, Random Oracle zu instanziieren, ohne dabei Sicherheit zu verlieren, die im Random Oracle Modell bewiesen wurde. Das dies mit Funktionsfamilien nicht geht ist eine wohl bekannte Aussage, die zuerst von Halevi et al. (IACR’1998) gezeigt wurde.
openaire +2 more sources
Finite mixture regression: A sparse variable selection by model selection for clustering [PDF]
, 2014 We consider a finite mixture of Gaussian regression model for high- dimensional data, where the number of covariates may be much larger than the sample size. We propose to estimate the unknown conditional mixture density by a maximum likelihood estimator,
Devijver, Emilie
core +4 more sources
Calibrating nonconvex penalized regression in ultra-high dimension [PDF]
, 2013 We investigate high-dimensional nonconvex penalized regression, where the number of covariates may grow at an exponential rate. Although recent asymptotic theory established that there exists a local minimum possessing the oracle property under general ...
Kim, Yongdai, Li, Runze, Wang, Lan
core +1 more source
Using intelligence techniques to automate Oracle testing [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2023 The software development life cycle includes software testing as a critical step. Oracle testing is necessary to determine if a particular test case detects an error because the purpose of testing is to ensure that the application adheres to its ...
Nour Sulaiman, safwan hasson
doaj +1 more source
QuantumCommitting 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
Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model [PDF]
International Journal of Electronics and Telecommunications, 2021 In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a ...
Mariusz Jurkiewicz
doaj +1 more source
On Pseudo-Random Oracles [PDF]
Tatra Mountains Mathematical Publications, 2012 ABSTRACT Many cryptographic systems which involve hash functions have proof of their security in a so called random oracle model. Behavior of hash functions used in such cryptographic systems should be as close as possible to the behavior of a random function. There are several properties of hash functions dealing with a random behavior.
openaire +1 more source
Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model [PDF]
, 2015 Strongly unforgeable signature schemes provide a more stringent security guarantee than the standard existential unforgeability. It requires that not only forging a signature on a new message is hard, it is infeasible as well to produce a new signature ...
Eaton, Edward, Song, Fang
core +3 more sources
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 +12 more
doaj +1 more source