scientific article; zbMATH DE number 2086711
From MaRDI portal
Publication:4737249
zbMATH Open1055.94026MaRDI QIDQ4737249FDOQ4737249
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
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Authentication, digital signatures and secret sharing (94A62) Finite abelian groups (20K01)
Cited In (26)
- Efficient transparent polynomial commitments for zk-SNARKs
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- Breaking RSA may be as difficult as factoring
- Generic hardness of inversion on ring and its relation to self-bilinear map
- Computing primitive idempotents in finite commutative rings and applications
- Parallel repetition of computationally sound protocols revisited
- Time- and space-efficient arguments from groups of unknown order
- A signature scheme based on the intractability of computing roots
- Breaking RSA Generically Is Equivalent to Factoring
- On the Equivalence of Generic Group Models
- Programmable hash functions and their applications
- Fine-grained forward-secure signature schemes without random oracles
- Zero-knowledge functional elementary databases
- Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
- Zero-knowledge arguments for subverted RSA groups
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Transparent SNARKs from DARK compilers
- Compact zero-knowledge proofs for threshold ECDSA with trustless setup
- 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
- Title not available (Why is that?)
- 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)