Bivariate Polynomials Modulo Composites and Their Applications

DOI10.1007/978-3-662-45611-8_3zbMath1306.94032OpenAlexW2105469720MaRDI QIDQ2938837

Henry Corrigan-Gibbs, Dan Boneh

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 polynomialsMerkle treescryptographic commitments

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Cryptanalysis of a dynamic universal accumulator over bilinear groups ⋮ Dynamic universal accumulator with batch update over bilinear groups ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial ⋮ Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives ⋮ Bivariate polynomial injections and elliptic curves ⋮ Commitment schemes and diophantine equations

This page was built for publication: Bivariate Polynomials Modulo Composites and Their Applications