The rapid development of location-based service(LBS) drives one special kind of LBS, in which the service provider verifies user location before providing services. In distributed location proof generating schemes, pr...The rapid development of location-based service(LBS) drives one special kind of LBS, in which the service provider verifies user location before providing services. In distributed location proof generating schemes, preventing users from colluding with each other to create fake location proofs and protecting user's location privacy at the same time, are the main technical challenges to bring this kind of LBS into practical. Existing solutions tackle these challenges with low collusion-detecting efficiency and defected collusion-detecting method. We proposed two novel location proof generating schemes, which inversely utilized a secure secret-sharing scheme and a pseudonym scheme to settle these shortcomings. Our proposed solution resists and detects user collusion attacks in a more efficient and correct way. Meanwhile, we achieve a higher level of location privacy than that of previous work. The correctness and efficiency of our proposed solution is testified by intensive security analysis, performance analysis, as well as experiments and simulation results.展开更多
Based on the first order predicate logic, in this paper, we present a new approach to generalizing the syn- tax of ordinary Horn clause rules to establish a fuzzy proof theory. First of all, each Horn clause rule is a...Based on the first order predicate logic, in this paper, we present a new approach to generalizing the syn- tax of ordinary Horn clause rules to establish a fuzzy proof theory. First of all, each Horn clause rule is associ- ated with a numerical implication strength f. Therefore we obtain f-Horn clause rules. Secondly, Herbrand in- terpretations can be generalized to fuzzy subsets of the Herbrand base in the sense of Zadeh. As a result the proof theory for Horn clause rules can be developed in much the same way for f-Horm clause rules.展开更多
The development of the object-oriented paradigm has suffered from the lackof any generally accepted formal foundations for its semantic definition. Toaddress this issue, we propose the development of the logic-based s...The development of the object-oriented paradigm has suffered from the lackof any generally accepted formal foundations for its semantic definition. Toaddress this issue, we propose the development of the logic-based semantics ofthe object-oriented paradigm. By combining the logic- with the object-orientedparadigm of computing first, this paper discusses formally the semantics of aquite purely object-oriented logic paradigm in terms of proof theory modeltheory and Aspoint theory from the viewpoint of logic. The operational anddeclarative semantics is given. And then the correspondence between soundnessand completeness has been discussed formally.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.41371402)the National Basic Research Program of China("973"Program)(Grant No.2011CB302306)the Fundamental Research Funds for the Central University(Grant No.2015211020201 and No.211274230)
文摘The rapid development of location-based service(LBS) drives one special kind of LBS, in which the service provider verifies user location before providing services. In distributed location proof generating schemes, preventing users from colluding with each other to create fake location proofs and protecting user's location privacy at the same time, are the main technical challenges to bring this kind of LBS into practical. Existing solutions tackle these challenges with low collusion-detecting efficiency and defected collusion-detecting method. We proposed two novel location proof generating schemes, which inversely utilized a secure secret-sharing scheme and a pseudonym scheme to settle these shortcomings. Our proposed solution resists and detects user collusion attacks in a more efficient and correct way. Meanwhile, we achieve a higher level of location privacy than that of previous work. The correctness and efficiency of our proposed solution is testified by intensive security analysis, performance analysis, as well as experiments and simulation results.
文摘Based on the first order predicate logic, in this paper, we present a new approach to generalizing the syn- tax of ordinary Horn clause rules to establish a fuzzy proof theory. First of all, each Horn clause rule is associ- ated with a numerical implication strength f. Therefore we obtain f-Horn clause rules. Secondly, Herbrand in- terpretations can be generalized to fuzzy subsets of the Herbrand base in the sense of Zadeh. As a result the proof theory for Horn clause rules can be developed in much the same way for f-Horm clause rules.
文摘The development of the object-oriented paradigm has suffered from the lackof any generally accepted formal foundations for its semantic definition. Toaddress this issue, we propose the development of the logic-based semantics ofthe object-oriented paradigm. By combining the logic- with the object-orientedparadigm of computing first, this paper discusses formally the semantics of aquite purely object-oriented logic paradigm in terms of proof theory modeltheory and Aspoint theory from the viewpoint of logic. The operational anddeclarative semantics is given. And then the correspondence between soundnessand completeness has been discussed formally.
