Bivariate polynomials modulo composites and their applications

DOI10.1007/978-3-662-45611-8_3MaRDI QIDQ2938837zbMATH OpenOpenAlexFDO

Authors Dan Boneh, Henry Corrigan-Gibbs

Publication date 16 January 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-45611-8_3

zbMATH Keywords

algebraic curvesbivariate polynomialscryptographic commitmentsMerkle trees

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A bivariate polynomial-based cryptographic hard problem and its applications
• Multivariates Polynomials for Hashing
• On Building Hash Functions from Multivariate Quadratic Equations
• VSH, an Efficient and Provable Collision-Resistant Hash Function
• Distributional collision resistance beyond one-way functions

Cited in

(12)

• Bivariables and Vénéreau polynomials
• Dynamic universal accumulator with batch update over bilinear groups
• Learning read-constant polynomials of constant degree modulo composites
• Bivariate polynomial injections and elliptic curves
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
• Partial bits exposure attacks on a new commitment scheme based on the Zagier polynomial
• Learning Read-Constant Polynomials of Constant Degree Modulo Composites
• Commitment schemes and diophantine equations
• A bivariate polynomial-based cryptographic hard problem and its applications
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
• Cryptanalysis of a dynamic universal accumulator over bilinear groups

This page was built for publication: Bivariate polynomials modulo composites and their applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938837)