Separation Results on the “One-More” Computational Problems

DOI10.1007/978-3-540-79263-5_5MaRDI QIDQ5458933zbMATHOpenAlexFDO

Authors Emmanuel Bresson, Jean Monnerat, Damien Vergnaud

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

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

Cited in

(13)

• A classification of computational assumptions in the algebraic group model
• On the adaptive security of MACs and PRFs
• The One-More Discrete Logarithm Assumption in the Generic Group Model
• Two-round threshold signature from algebraic one-more learning with errors
• On the security loss of unique signatures
• Black-box separations for one-more (static) CDH and its generalization
• Skipping the \(q\) in group signatures
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• A tightly secure ID-based signature scheme under DL assumption in AGM
• New limits of provable security and applications to ElGamal encryption
• Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Adaptive proofs have straightline extractors (in the random oracle 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)