Sciweavers

608 search results - page 8 / 122
» Interactive Oracle Proofs
Sort
View
TPHOL
2007
IEEE
14 years 4 months ago
Source-Level Proof Reconstruction for Interactive Theorem Proving
Abstract. Interactive proof assistants should verify the proofs they receive from automatic theorem provers. Normally this proof reconstruction takes place internally, forming part...
Lawrence C. Paulson, Kong Woei Susanto
TYPES
2004
Springer
14 years 3 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
ACISP
2006
Springer
14 years 1 months ago
An Extension to Bellare and Rogaway (1993) Model: Resetting Compromised Long-Term Keys
Abstract. A security proof in the Bellare
Colin Boyd, Kim-Kwang Raymond Choo, Anish Mathuria
CRYPTO
2006
Springer
224views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the...
Xavier Boyen, Brent Waters
SECRYPT
2007
126views Business» more  SECRYPT 2007»
13 years 11 months ago
Additive Proofs of Knowledge - A New Notion for Non-Interactive Proofs
In this paper, we study the opacity property of verifiably encrypted signatures (VES) of Boneh et al. (proposed in Eurocrypt 2003). Informally, opacity implies that although some...
Amitabh Saxena