Sciweavers

2432 search results - page 14 / 487
» Cryptographic logical relations
Sort
View
MYCRYPT
2005
Springer
248views Cryptology» more  MYCRYPT 2005»
15 years 3 months ago
A Family of Fast Syndrome Based Cryptographic Hash Functions
Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using simi...
Daniel Augot, Matthieu Finiasz, Nicolas Sendrier
POPL
2010
ACM
15 years 7 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
IAJIT
2010
157views more  IAJIT 2010»
14 years 8 months ago
Fast Cryptographic Privacy Preserving Association Rules Mining on Distributed Homogenous Database
: Privacy is one of the most important properties of an information system must satisfy, in which systems the need to share information among different, not trusted entities, the p...
Ashraf El-Sisi
KES
2008
Springer
14 years 8 months ago
Fast Cryptographic Privacy Preserving Association Rules Mining on Distributed Homogenous Data Base
Privacy is one of the most important properties of an information system must satisfy. In which systems the need to share information among different, not trusted entities, the pro...
Mahmoud Hussein, Ashraf El-Sisi, Nabil A. Ismail
WOLLIC
2009
Springer
15 years 4 months ago
An Independence Relation for Sets of Secrets
A relation between two secrets, known in the literature as nondeducibility, was originally introduced by Sutherland. We extend it to a relation between sets of secrets that we call...
Sara Miner More, Pavel Naumov