OrBit: OR-proof identity-based identification with tight security for (as low as) 1-bit loss

DOI10.1007/978-3-030-90402-9_7OpenAlexW3209286149MaRDI QIDQ2697915

Jason Chia, Sook-Chin Yip, Ji-Jian Chin

Publication date: 13 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90402-9_7

zbMATH Keywords

identity-based cryptographytight securitysecurity reductionOR-proofidentification protocol

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• A new framework for the design and analysis of identity-based identification schemes
• Improving signature schemes with tight security reductions
• Tight security for the generic construction of identity-based signature (in the multi-instance setting)
• On the security of a modified Beth identity-based identification scheme
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Advances in Cryptology - EUROCRYPT 2004
• On the Security of Beth’s Identification Schemes against Active and Concurrent Adversaries
• On the Impossibility of Tight Cryptographic Reductions
• Public Key Cryptography – PKC 2004

This page was built for publication: OrBit: OR-proof identity-based identification with tight security for (as low as) 1-bit loss