Presentation 2003/7/10
A new deduction system for cryptographic primitives and their security properties
Ashraf Moustafa BHERY, Shigeki HAGIHARA, Naoki YONEZAKI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The characterization and security properties of cryptographic orimitives such as asymmetric encrvotion schemes have been well developed using the notions of probability and complexity theory. ln this paper, we propose a new deduction system called the JDE-system which can be used to formalize an idealized asymmetric encryption scheme. In our system, deductive reasoning is used to identify similar security properties of different asymmetric encryption schemes. New functions are introduced for describing several security properties. For example, by using the function 'content-of', we can provide a sufficient set of inference rules that are used to formalize facts such as "without seeing the content of ciphertexts, an attacker has the opportunity to see whether two different ciphertexts have the same content". We use the notion of "judgement"in our IDE-system. Conversely, we also introduce the notion of "Unjudgement"as a property of JDE-system. By using these notions, we can define the content-indistinguishability, key-indistinguishabilty, content-non-malleability, and key-non-malleability of asymmetric encryption schemes. A proof is given showing the sufficient conditions for these security properties. We also clarify the relationships that exist between these security properties. Two new security properties that we call key-non-malleability, and content-length-non-malleability are proven using the JDE-system. The JDE-system identifies all of the procedures that an attacker could employ. In this sense, the JDE-system is a completely intuitionistic axiomatic realization of an encrvotion scheme.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) asymmetric encryption / judgment / unjudgment / deduction systems / content-indistinguishability / key-indistinguishabilty / content-non-malleability / key-non-malleability / content-length-non-malleability
Paper # ISEC2003-16
Date of Issue

Conference Information
Committee ISEC
Conference Date 2003/7/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A new deduction system for cryptographic primitives and their security properties
Sub Title (in English)
Keyword(1) asymmetric encryption
Keyword(2) judgment
Keyword(3) unjudgment
Keyword(4) deduction systems
Keyword(5) content-indistinguishability
Keyword(6) key-indistinguishabilty
Keyword(7) content-non-malleability
Keyword(8) key-non-malleability
Keyword(9) content-length-non-malleability
1st Author's Name Ashraf Moustafa BHERY
1st Author's Affiliation Tokyo Institute of Technology, Graduate School of Information Science and Engineering, Department of Computer Science()
2nd Author's Name Shigeki HAGIHARA
2nd Author's Affiliation Tokyo Institute of Technology, Graduate School of Information Science and Engineering, Department of Computer Science
3rd Author's Name Naoki YONEZAKI
3rd Author's Affiliation Tokyo Institute of Technology, Graduate School of Information Science and Engineering, Department of Computer Science
Date 2003/7/10
Paper # ISEC2003-16
Volume (vol) vol.103
Number (no) 195
Page pp.pp.-
#Pages 7
Date of Issue