• Title/Summary/Keyword: The Proving of Theorem

Search Result 52, Processing Time 0.032 seconds

PROVING UNIFIED COMMON FIXED POINT THEOREMS VIA COMMON PROPERTY (E-A) IN SYMMETRIC SPACES

  • Soliman, Ahmed Hussein;Imdad, Mohammad;Hasan, Mohammad
    • Communications of the Korean Mathematical Society
    • /
    • v.25 no.4
    • /
    • pp.629-645
    • /
    • 2010
  • A metrical common fixed point theorem proved for a pair of self mappings due to Sastry and Murthy ([16]) is extended to symmetric spaces which in turn unifies certain fixed point theorems due to Pant ([13]) and Cho et al. ([4]) besides deriving some related results. Some illustrative examples to highlight the realized improvements are also furnished.

Safety Analysis and Design of the RFID Authentication Protocol Using Theorem Proving (정리증명을 이용한 RFID 인증 프로토콜 설계 및 검증)

  • Oh Jung-Hyun;Choi Jin-Young
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06c
    • /
    • pp.301-303
    • /
    • 2006
  • RFID기술은 RF를 이용하여 자동적으로 사물의 정보를 획득할 수 있는 매우 편리한 기술이다. 하지만 악의적인 공격자에 의해 사물의 의도적으로 노출이 될 수 있는 문제를 지니고 있다. 이러한 RFID 시스템의 보안적 취약점을 보안하기 위해 많은 프로토콜들이 제안되었지만, 아직까지 완벽하게 보안성과 경제성을 모두 만족시키지 못하였고, 직관적인 방법에 의해 제안 프로토콜들을 검증하여 명확한 검증이 이뤄졌다고 할 수 없다. 본 논문에서는 새로운 RFID 인증 프로토콜을 제안하고 직관적인 검증이 아닌 정형기법을 이용하여 프로토콜의 보안성을 검증하였다.

  • PDF

Design and Implementation of Web Ontology Inference System Using Axiomatisation (어휘의 공리화를 이용한 Web Ontology 추론 시스템의 설계 및 구현)

  • 하영국;손주찬;함호상
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10c
    • /
    • pp.559-561
    • /
    • 2003
  • 최근 차세대 Web 기술로서 Semantic Web이 주목 받고 있다. Semantic Web에서는 Web상에 존재하는 문서에 Web Resource들에 대한 Ontology를 기반으로 Semantic Annotation을 하고 Ontology 추론 Agent를 통하여 의미 기반으로 Web을 검색할 수 있도록 해준다. 이와 같은 Semantic Web 기술의 핵심 요소는 Web Ontology이며 W3C에서는 이를 표현 할 수 있는 표준 언어로서 RDF기반의 OWL(Web Ontology Language) 명세를 제정하고 있다. 따라서 표준 Web Ontology 언어인 OWL을 위한 추론 시스템은 Semantic Web 검색 Agent의 구현을 위한 필수적인 기반 기술이라 할 수 있으나 아직 그 개발이 미비한 상태이다. OWL 추론 시스템을 구현하기 위해서는 OWL의 이론적인 기반을 제공하는 DL(Description Logic)을 추론할 수 있는 엔진을 사용하는 것이 한가지 방법이 될 수 있으나 OWL이 Rule과 같은 DL의 범주를 벗어나는 Vocabulary를 지원하는 언어로 확장되는 경우에 이를 처리하기가 어렵다. 또 다른 방법으로서 Logic Programming을 통하여 OWL 언어의 Semantic을 기술하고 정리 증명(Theorem Proving)을 통하여 Ontology를 추론하는 공리화(Axiomatisation) 기법이 있는데 이러한 방법의 장점은 기반이 되는 Logic의 범주 내에서 새로운 언어를 위한 Vocabulary의 확장이 용이하다는 점이다. 본 논문에서는 Axiomatisation 방법을 이용하여 OWL로 기술된 Ontology를 추론할 수 있는 시스템의 설계 및 구현에 대해 설명하기로 한다.

  • PDF

Improvement of a Verified Secure Key Distribution Protocol Between RFID and Readers (RFID와 리더간의 안전성이 검증된 키 분배 프로토콜의 개선)

  • Bae, Woo-Sik;Lee, Jong-Yun
    • The KIPS Transactions:PartC
    • /
    • v.18C no.5
    • /
    • pp.331-338
    • /
    • 2011
  • The RFID system includes a section of wireless communication between the readers and the tags. Because of its vulnerability in terms of security, this part is always targeted by attackers and causes various security problems including the leakage of secret and the invasion of privacy. In response to these problems, various protocols have been proposed, but because many of them have been hardly implementable they have been limited to theoretical description and theorem proving without the accurate verification of their safety. Thus, this study tested whether the protocol proposed by Kenji et al. satisfies security requirements, and identified its vulnerabilities such as the exposure of IDs and messages. In addition, we proposed an improved RFID security protocol that reduced the number of public keys and random numbers. As one of its main characteristics, the proposed protocol was designed to avoid unnecessary calculations and to remove vulnerabilities in terms of security. In order to develop and verify a safe protocol, we tested the protocol using Casper and FDR(Failure Divergence Refinements) and confirmed that the proposed protocol is safe in terms of security. Furthermore, the academic contributions of this study are summarized as follows. First, this study tested the safety of a security protocol through model checking, going beyond theorem proving. Second, this study suggested a more effective method for protocol development through verification using FDR.

A Study on the Proof Education in the Middle School Geometry - Focused on the Theory of van Hiele and Freudenthal - (중학교 기하의 증명 지도에 관한 소고 - van Hiele와 Freudenthal의 이론을 중심으로 -)

  • 나귀수
    • Journal of Educational Research in Mathematics
    • /
    • v.8 no.1
    • /
    • pp.291-298
    • /
    • 1998
  • This study deals with the problem of proof education in the middle school geometry bby examining van Hiele#s geometric thought level theory and Freudenthal#s mathematization teaching theory. The implications that have been revealed by examining the theory of van Hie이 and Freudenthal are as follows. First of all, the proof education at present that follows the order of #definition-theorem-proof#should be reconsidered. This order of proof-teaching may have the danger that fix the proof education poorly and formally by imposing the ready-made mathematics as the mere record of proof on students rather than suggesting the proof as the real thought activity. Hence we should encourage students in reinventing #proving#as the means of organization and mathematization. Second, proof-learning can not start by introducing the term of proof only. We should recognize proof-learning as a gradual process which forms with understanding the meaning of proof on the basic of the various activities, such as observation of geometric figures, analysis of the properties of geometric figures and construction of the relationship among those properties. Moreover students should be given this natural ground of proof.

  • PDF

A Study on the Visualization of Middle & High School Mathematics (중.고등학교 수학의 시각화)

  • 문광호;우정호
    • School Mathematics
    • /
    • v.1 no.1
    • /
    • pp.135-156
    • /
    • 1999
  • The purpose of this study is to discuss about the role of the visualization as an effective method of teaching abstracted mathematics, to analyze visual materials in middle and high school mathematics and to suggest various visualized materials for teaching mathematics effectively. Though formal, symbolic and analytical teaching method is a major characteristic of mathematics, the students should be taught to understand through intuition and insight, and formalize the mathematical concepts progressively. Especially the sight is one of the most important basics of cognition for intuition and insight. Therefore, suggesting mathematical contents through the visual method makes the students understand and formalize the mathematical concepts more easily. In this study, we tried to investigate the meaning and role of visualization in mathematics teaching. And, we discussed about the four roles of visualization in the process of mathematics teaching and learning confirmation and memorization of the mathematical truth, proving theorem and solving problems which is one of the most important purposes of teaching mathematics, According to the roles of visualization, we analyzed visual materials currently taught in middle and high school, and suggested various visual materials useful in teaching mathematics. The investigated fields are algebra where visual materials are little used, and geometry where they are use the most. The paper-made-textbook can't show moving animation vigorously. Hence we suggested visual materials made by GSP and applets in IES .

  • PDF

A Generalized Hyperparamodulation Strategy Based on a Forward Reasoning for the Equality Relation ; RHU- resolution*

  • Lee, Jin-Hyeong;Im, Yeong-Hwan;O, Gil-Rok
    • ETRI Journal
    • /
    • v.9 no.1
    • /
    • pp.84-96
    • /
    • 1987
  • The equality relation is very important in mechanical theorem proving procedures. A proposed inference rule called RHU-resolution is intended to extend the hyperparamodulation[23, 9] by introducing a bidirectional proof search that simultaneously employs a forward reasoning and a backward reasoning, and generalize it by incorporating beneflts of extended hyper steps with a preprocessing process, that includes a subsumption check in an equality graph and a high level planning. The forward reasoning in RHU-resolution may replace the role of the function substitution link.[9] That is, RHU-deduction without the function substitution link gets a proof. In order to control explosive generation of positive equalities by the forward reasoning, we haue put some restrictions on input clauses and k-pd links, and also have included a control strategy for a positive-positive linkage, like the set-of-support concept, A linking path between two end terms can be found by simple checking of linked unifiability using the concept of a linked unification. We tried to prevent redundant resolvents from generating by preprocessing using a subsumption check in the subsumption based eauality graph(SPD-Graph)so that the search space for possible RHU-resolution may be reduced.

  • PDF

Analysis on Students' Abilities of Proof in Middle School (중학교 학생의 증명 능력 분석)

  • 서동엽
    • Journal of Educational Research in Mathematics
    • /
    • v.9 no.1
    • /
    • pp.183-203
    • /
    • 1999
  • In this study, we analysed the constituents of proof and examined into the reasons why the students have trouble in learning the proof, and proposed directions for improving the teaming and teaching of proof. Through the reviews of the related literatures and the analyses of textbooks, the constituents of proof in the level of middle grades in our country are divided into two major categories 'Constituents related to the construction of reasoning' and 'Constituents related to the meaning of proof. 'The former includes the inference rules(simplification, conjunction, modus ponens, and hypothetical syllogism), symbolization, distinguishing between definition and property, use of the appropriate diagrams, application of the basic principles, variety and completeness in checking, reading and using the basic components of geometric figures to prove, translating symbols into literary compositions, disproof using counter example, and proof of equations. The latter includes the inferences, implication, separation of assumption and conclusion, distinguishing implication from equivalence, a theorem has no exceptions, necessity for proof of obvious propositions, and generality of proof. The results from three types of examinations; analysis of the textbooks, interview, writing test, are summarized as following. The hypothetical syllogism that builds the main structure of proofs is not taught in middle grades explicitly, so students have more difficulty in understanding other types of syllogisms than the AAA type of categorical syllogisms. Most of students do not distinguish definition from property well, so they find difficulty in symbolizing, separating assumption from conclusion, or use of the appropriate diagrams. The basic symbols and principles are taught in the first year of the middle school and students use them in proving theorems after about one year. That could be a cause that the students do not allow the exact names of the principles and can not apply correct principles. Textbooks do not describe clearly about counter example, but they contain some problems to solve only by using counter examples. Students have thought that one counter example is sufficient to disprove a false proposition, but in fact, they do not prefer to use it. Textbooks contain some problems to prove equations, A=B. Proving those equations, however, students do not perceive that writing equation A=B, the conclusion of the proof, in the first line and deforming the both sides of it are incorrect. Furthermore, students prefer it to developing A to B. Most of constituents related to the meaning of proof are mentioned very simply or never in textbooks, so many students do not know them. Especially, they accept the result of experiments or measurements as proof and prefer them to logical proof stated in textbooks.

  • PDF

Inter-device Mutual authentication and Formal Verification in M2M Environment (M2M 환경에서 장치간 상호 인증 및 정형검증)

  • Bae, WooSik
    • Journal of Digital Convergence
    • /
    • v.12 no.9
    • /
    • pp.219-223
    • /
    • 2014
  • In line with the advanced wireless communication technology, M2M (Machine-to-Machine) communication has drawn attention in industry. M2M communication features are installed and operated in the fields where human accessibility is highly limited such as disaster, safety, construction, health and welfare, climate, environment, logistics, culture, defense, medical care, agriculture and stockbreeding. In M2M communication, machine replaces people for automatic communication and countermeasures as part of unmanned information management and machine operation. Wireless M2M inter-device communication is likely to be exposed to intruders' attacks, causing security issues, which warrants proper security measures including cross-authentication of whether devices are legitimate. Therefore, research on multiple security protocols has been conducted. The present study applied SessionKey, HashFunction and Nonce to address security issues in M2M communication and proposed a safe protocol with reinforced security properties. Notably, unlike most previous studies arguing for the security of certain protocols based on mathematical theorem proving, the present study used the formal verification with Casper/FDR to prove the safety of the proposed protocol. In short, the proposed protocol was found to be safe and secure.

Verification of Safety in a RFID Security Authentication Protocol Using Session and Public Keys (세션키 및 공개키를 이용한 RFID 보안 인증 프로토콜의 안전성 검증)

  • Bae, Woo Sik;Lee, Jong Yun
    • Journal of Digital Convergence
    • /
    • v.10 no.10
    • /
    • pp.325-332
    • /
    • 2012
  • Due to its communication vulnerability resulting in a range of problems, e.g. eavesdropping, information exposure, traffic analysis and spoofing, RFID system becomes the target of attackers. Accordingly, many investigators have proposed various protocols to the extent of theorem proving or verification as the implementation is challenging. This paper thus proposes a safe RFID security protocol using public keys, session keys, hashes, XORs, and random numbers. Timestamps and hashes are applied to the most vulnerable section between readers and tags to detect attacks in attack signals with time difference. Also, to prevent tag information from being exposed in the last session, hash operation is adopted before communication. Finally, in this paper, we designed a RFID security protocol using public and session keys applicable to real systems and verified the security of the proposed protocol with a differentiated formal verification technique.