Sciweavers

370 search results - page 33 / 74
» Limits of Constructive Security Proofs
Sort
View
POPL
2004
ACM
14 years 8 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
14 years 19 days ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...
PLDI
2009
ACM
14 years 2 months ago
Laminar: practical fine-grained decentralized information flow control
Decentralized information flow control (DIFC) is a promising model for writing programs with powerful, end-to-end security guarantees. Current DIFC systems that run on commodity ...
Indrajit Roy, Donald E. Porter, Michael D. Bond, K...
ACSAC
2002
IEEE
14 years 1 months ago
Malicious Code Detection for Open Firmware
Malicious boot firmware is a largely unrecognized but significant security risk to our global information infrastructure. Since boot firmware executes before the operating syst...
Frank Adelstein, Matthew Stillerman, Dexter Kozen
CALCO
2007
Springer
100views Mathematics» more  CALCO 2007»
14 years 2 months ago
Applications of Metric Coinduction
Metric coinduction is a form of coinduction that can be used to establish properties of objects constructed as a limit of finite approximations. One can prove a coinduction step s...
Dexter Kozen, Nicholas Ruozzi