Sciweavers

1843 search results - page 31 / 369
» Securing Class Initialization
Sort
View
JCS
2008
109views more  JCS 2008»
15 years 1 months ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...
AUSAI
2003
Springer
15 years 7 months ago
Association Rule Discovery with Unbalanced Class Distributions
There are many methods for finding association rules in very large data. However it is well known that most general association rule discovery methods find too many rules, which...
Lifang Gu, Jiuyong Li, Hongxing He, Graham J. Will...
ISSRE
2002
IEEE
15 years 6 months ago
Inter-Class Mutation Operators for Java
The effectiveness of mutation testing depends heavily on the types of faults that the mutation operators are designed to represent. Therefore, the quality of the mutation operator...
Yu-Seung Ma, Yong Rae Kwon, Jeff Offutt
CTRSA
2006
Springer
107views Cryptology» more  CTRSA 2006»
15 years 5 months ago
A Round and Communication Efficient Secure Ranking Protocol
In this work, we initiate the study of realizing a ranking functionality (m1,
Shaoquan Jiang, Guang Gong
DAGSTUHL
2003
15 years 3 months ago
Operational Semantics of Security Protocols
Based on a concise domain analysis we develop a formal semantics of security protocols. Its main virtue is that it is a generic model, in the sense that it is parameterized over e...
Cas J. F. Cremers, Sjouke Mauw