scientific article; zbMATH DE number 2086711

MaRDI QIDQ4737249zbMATH OpenFDO

Authors Maciej Koprowski, Ivan B. Damgård

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2332/23320256.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Authentication, digital signatures and secret sharing (94A62) Finite abelian groups (20K01)

Recommendations

• A signature scheme based on the intractability of computing roots
• On the Equivalence of Generic Group Models
• scientific article; zbMATH DE number 1303114
• Publication:4945389
• scientific article; zbMATH DE number 1583798

Cited in

(26)

• Efficient transparent polynomial commitments for zk-SNARKs
• Breaking RSA may be as difficult as factoring
• Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
• Generic hardness of inversion on ring and its relation to self-bilinear map
• Parallel repetition of computationally sound protocols revisited
• Time- and space-efficient arguments from groups of unknown order
• Computing primitive idempotents in finite commutative rings and applications
• A signature scheme based on the intractability of computing roots
• Breaking RSA Generically Is Equivalent to Factoring
• Programmable hash functions and their applications
• On the Equivalence of Generic Group Models
• Fine-grained forward-secure signature schemes without random oracles
• Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
• Zero-knowledge functional elementary databases
• Zero-knowledge arguments for subverted RSA groups
• \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
• Transparent SNARKs from DARK compilers
• Compact zero-knowledge proofs for threshold ECDSA with trustless setup
• Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
• Inner product functional commitments with constant-size public parameters and openings
• Efficiency limitations for \(\Sigma \)-protocols for group homomorphisms
• A Trustless GQ Multi-signature Scheme with Identifiable Abort
• scientific article; zbMATH DE number 1424189 (Why is no real title available?)
• On time-lock cryptographic assumptions in abelian hidden-order groups
• On the analysis of cryptographic assumptions in the generic ring model
• Root extraction in finite abelian groups

This page was built for publication:

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