Sciweavers

2432 search results - page 40 / 487
» Cryptographic logical relations
Sort
View
CADE
2010
Springer
14 years 11 months ago
Decreasing Diagrams and Relative Termination
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
Nao Hirokawa, Aart Middeldorp
DIAGRAMS
2010
Springer
14 years 10 months ago
Fragments of Spider Diagrams of Order and Their Relative Expressiveness
Abstract. Investigating the expressiveness of a diagrammatic logic provides insight into how its syntactic elements interact at the semantic level. Moreover, it allows for comparis...
Aidan Delaney, Gem Stapleton, John Taylor, Simon J...
TABLEAUX
2009
Springer
15 years 4 months ago
A Tableau-Based System for Spatial Reasoning about Directional Relations
Abstract. The management of qualitative spatial information is an important research area in computer science and AI. Modal logic provides a natural framework for the formalization...
Davide Bresolin, Angelo Montanari, Pietro Sala, Gu...
EUROCRYPT
2010
Springer
15 years 2 months ago
Computational Soundness, Co-induction, and Encryption Cycles
We analyze the relation between induction, co-induction and the presence of encryption cycles in the context of computationally sound symbolic equivalence of cryptographic express...
Daniele Micciancio
IACR
2011
206views more  IACR 2011»
13 years 9 months ago
Shortest Lattice Vectors in the Presence of Gaps
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
Mingjie Liu, Xiaoyun Wang, Guangwu Xu, Xuexin Zhen...