Sciweavers

2432 search results - page 22 / 487
» Cryptographic logical relations
Sort
View
AINA
2007
IEEE
15 years 4 months ago
Towards Quantifying the (In)Security of Networked Systems
Traditional security analyses are often geared towards cryptographic primitives or protocols. Although such analyses are absolutely necessary, they do not provide much insight for...
Xiaohu Li, T. Paul Parker, Shouhuai Xu
FSEN
2007
Springer
15 years 4 months ago
Hoare Logic for ARM Machine Code
This paper shows how a machine-code Hoare logic is used to lift reasoning from the tedious operational model of a machine lana manageable level of abstraction without making simpli...
Magnus O. Myreen, Anthony C. J. Fox, Michael J. C....
CCS
2006
ACM
15 years 1 months ago
Modelling the relative strength of security protocols
In this paper, we present a way to think about the relative strength of security protocols using SoS, a lattice-theoretic representation of security strength. In particular, we di...
Ho Chung, Clifford Neuman
ISSA
2008
14 years 11 months ago
Application of Message Digests for the Verification of Logical Forensic Data
A message digest is a fixed length output produced by applying a cryptographic algorithm on input binary data of arbitrary length. If the input data changes even by one bit, the g...
Pontjho Mokhonoana, Martin S. Olivier
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
15 years 11 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...