Lossy identification schemes from decisional RSA
From MaRDI portal
Publication:5135709
Recommendations
- Tightly secure signatures from lossy identification schemes
- Tightly-secure signatures from lossy identification schemes
- From identification using rejection sampling to signatures via the Fiat-Shamir transform: application to the BLISS signature
- Tighter Reductions for Forward-Secure Signature Schemes
- Efficient identification and signature schemes
Cites work
- Chosen ciphertext secure encryption under factoring assumption revisited
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4170086 (Why is no real title available?)
- scientific article; zbMATH DE number 1304086 (Why is no real title available?)
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- Improving the exact security of digital signature schemes
- Lattice signatures without trapdoors
- On the fly authentication and signature schemes based on groups of unknown order
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Theory of Cryptography
- Theory of Cryptography
- Tighter Reductions for Forward-Secure Signature Schemes
- Tightly-secure signatures from lossy identification schemes
This page was built for publication: Lossy identification schemes from decisional RSA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5135709)