A bivariate polynomial-based cryptographic hard problem and its applications (Q6109708): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10623-023-01229-1 / rank
Normal rank
 
Property / cites work
 
Property / cites work: DL-extractable UC-commitment schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lattice-based digital signature scheme qTESLA / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient publicly verifiable and proactive secret sharing scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - ASIACRYPT 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small solutions to polynomial equations, and low exponent RSA vulnerabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paillier-based publicly verifiable (non-interactive) secret sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10623-023-01229-1 / rank
 
Normal rank

Latest revision as of 18:32, 30 December 2024

scientific article; zbMATH DE number 7720067
Language Label Description Also known as
English
A bivariate polynomial-based cryptographic hard problem and its applications
scientific article; zbMATH DE number 7720067

    Statements

    A bivariate polynomial-based cryptographic hard problem and its applications (English)
    0 references
    0 references
    28 July 2023
    0 references
    cryptographic hard problem
    0 references
    public-key cryptography
    0 references
    RSA cryptosystem
    0 references
    lattices
    0 references
    commitment schemes
    0 references

    Identifiers