Sciweavers

526 search results - page 67 / 106
» A Z Based Approach to Verifying Security Protocols
Sort
View
POPL
2005
ACM
14 years 8 months ago
Statically checking confidentiality via dynamic labels
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
Bart Jacobs, Wolter Pieters, Martijn Warnier
CGO
2005
IEEE
14 years 1 months ago
Building Intrusion-Tolerant Secure Software
In this work, we develop a secret sharing based compiler solution to achieve confidentiality, integrity and availability (intrusion tolerance) of critical data together, rather th...
Tao Zhang, Xiaotong Zhuang, Santosh Pande
ASIACRYPT
2006
Springer
13 years 11 months ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth
CCS
2005
ACM
14 years 1 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...
DSN
2006
IEEE
14 years 1 months ago
VoIP Intrusion Detection Through Interacting Protocol State Machines
Being a fast-growing Internet application, Voice over Internet Protocol (VoIP) shares the network resources with the regular Internet traffic, and is susceptible to the existing ...
Hemant Sengar, Duminda Wijesekera, Haining Wang, S...