Sciweavers

4099 search results - page 34 / 820
» A Framework for Interactive Proof
Sort
View
89
Voted
CADE
2003
Springer
15 years 10 months ago
Foundational Certified Code in a Metalogical Framework
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
Karl Crary, Susmit Sarkar
SLOGICA
1998
128views more  SLOGICA 1998»
14 years 9 months ago
Encoding Modal Logics in Logical Frameworks
We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert- and Natural Deductionstyle proof systems for ...
Arnon Avron, Furio Honsell, Marino Miculan, Cristi...
SECURWARE
2008
IEEE
15 years 4 months ago
Rating Agencies Interoperation for Peer-to-Peer Online Transactions
— In current peer-to-peer systems users interact with unknown services and users for the purpose of online transactions such as file sharing and trading of commodities. Peer-to-...
Mihaela Ion, Hristo Koshutanski, Volker Hoyer, Lui...
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
15 years 1 months ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan