Citation

Chia, Jason and Chin, Ji Jian and Yip, Sook Chin (2021) OrBit: OR-Proof Identity-Based Identification with Tight Security for (as Low As) 1-Bit Loss. Lecture Notes in Computer Science, 13059. pp. 116-135. ISSN 0302-9743

Full text not available from this repository.

Abstract

Tightening the security reduction of a cryptosystem involves reducing the advantage of an adversary breaking the cryptosystem to a security assumption as closely as possible. Tighter security on a cryptosystem shows a clearer picture of its security, allowing for a more optimal security parameter at a certain level. In this work, we propose techniques to tighten the security of identity-based identification (IBI) schemes and demonstrate promising new results compared to existing reduction bounds. We show two distinct transformations for tightening security against concurrent attackers via the OR-proof technique of Fujioka et al. to lower security reduction loss. Our proposed techniques produce tighter security guarantees for as low as only a one-bit loss bound, hence the name: OrBit.

Item Type:	Article
Uncontrolled Keywords:	Identity-based cryptography, Identification protocol, OR-proof, Security reduction
Subjects:	Q Science > QA Mathematics > QA150-272.5 Algebra
Divisions:	Faculty of Computing and Informatics (FCI) Faculty of Engineering (FOE)
Depositing User:	Ms Nurul Iqtiani Ahmad
Date Deposited:	17 Jan 2022 13:19
Last Modified:	17 Jan 2022 13:19
URII:	http://shdl.mmu.edu.my/id/eprint/9851

Downloads

Edit (login required)