A bivariate polynomial-based cryptographic hard problem and its applications

DOI10.1007/s10623-023-01229-1zbMath1518.94042OpenAlexW4367368509MaRDI QIDQ6109708

Bagher Bagherpour

Publication date: 28 July 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-023-01229-1

zbMATH Keywords

latticespublic-key cryptographyRSA cryptosystemcommitment schemescryptographic hard problem

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paillier-based publicly verifiable (non-interactive) secret sharing
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
• The lattice-based digital signature scheme qTESLA
• DL-extractable UC-commitment schemes
• Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
• Lattice-based Cryptography
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
• Cryptography
• Advances in Cryptology - ASIACRYPT 2003
• An efficient publicly verifiable and proactive secret sharing scheme

This page was built for publication: A bivariate polynomial-based cryptographic hard problem and its applications