Separation Results on the “One-More” Computational Problems

DOI10.1007/978-3-540-79263-5_5zbMath1153.94355OpenAlexW1589399207MaRDI QIDQ5458933

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

On the security loss of unique signatures ⋮ Skipping the \(q\) in group signatures ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ On the adaptive security of MACs and PRFs ⋮ A classification of computational assumptions in the algebraic group model

Cites Work

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

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