Sciweavers

2432 search results - page 15 / 487
» Cryptographic logical relations
Sort
View
VMCAI
2010
Springer
15 years 7 months ago
Collections, Cardinalities, and Relations
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
Kuat Yessenov, Ruzica Piskac, Viktor Kuncak
TARK
2007
Springer
15 years 4 months ago
Full and relative awareness: a decidable logic for reasoning about knowledge of unawareness
In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of so...
Thomas Ågotnes, Natasha Alechina
ECSQARU
2003
Springer
15 years 3 months ago
On the Relation between Reiter's Default Logic and Its (Major)
Abstract. Default logic is one of the best known and most studied of the approaches to nonmonotonic reasoning. Subsequently, several variants of default logic have been proposed to...
James P. Delgrande, Torsten Schaub
DATE
2006
IEEE
95views Hardware» more  DATE 2006»
15 years 1 months ago
Satisfiability-based framework for enabling side-channel attacks on cryptographic software
- Many electronic systems contain implementations of cryptographic algorithms in order to provide security. It is well known that cryptographic algorithms, irrespective of their th...
Nachiketh R. Potlapally, Anand Raghunathan, Srivat...
EUROCRYPT
2001
Springer
15 years 2 months ago
Cryptographic Counters and Applications to Electronic Voting
We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value pri...
Jonathan Katz, Steven Myers, Rafail Ostrovsky