Separation Results on the “One-More” Computational Problems

DOI10.1007/978-3-540-79263-5_5zbMATH Open1153.94355OpenAlexW1589399207MaRDI QIDQ5458933FDOQ5458933

Jean Monnerat, Damien Vergnaud, Emmanuel Bresson

Publication date: 24 April 2008

Published in: Topics in Cryptology – CT-RSA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79263-5_5

Recommendations

• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• On the impossibility of three-move blind signature schemes
• Black-box separations for one-more (static) CDH and its generalization
• scientific article; zbMATH DE number 2088331
• scientific article; zbMATH DE number 2080670

zbMATH Keywords

Algebraic algorithms``One-more problemsBlack-box reductionsRandom self-reducible problems

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Security arguments for digital signatures and blind signatures
• Short signatures from the Weil pairing
• Efficient signature generation by smart cards
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Title not available (Why is that?)
• Title not available (Why is that?)
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Transitive Signatures: New Schemes and Proofs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Undeniable Signatures
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log

Cited In (12)

• Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
• The One-More Discrete Logarithm Assumption in the Generic Group Model
• On the security loss of unique signatures
• Skipping the \(q\) in group signatures
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• New limits of provable security and applications to ElGamal encryption
• Two-round threshold signature from algebraic one-more learning with errors
• On the adaptive security of MACs and PRFs
• A tightly secure ID-based signature scheme under DL assumption in AGM
• Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model)
• A classification of computational assumptions in the algebraic group model

This page was built for publication: Separation Results on the “One-More” Computational Problems

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