Sciweavers

12774 search results - page 153 / 2555
» A Framework for Proof Systems
Sort
View
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
15 years 10 months ago
Simulatable VRFs with Applications to Multi-theorem NIZK
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...
Melissa Chase, Anna Lysyanskaya
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
16 years 1 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
ICFEM
2007
Springer
15 years 8 months ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver
TCC
2009
Springer
123views Cryptology» more  TCC 2009»
16 years 5 months ago
Hierarchical Identity Based Encryption with Polynomially Many Levels
We present the first hierarchical identity based encryption (HIBE) system that has full security for more than a constant number of levels. In all prior HIBE systems in the literat...
Craig Gentry, Shai Halevi
ICNP
2002
IEEE
15 years 9 months ago
A Lightweight, Robust P2P System to Handle Flash Crowds
Abstract— Internet flash crowds (a.k.a. hot spots) are a phenomenon that result from a sudden, unpredicted increase in an on-line object’s popularity. Currently, there is no e...
Angelos Stavrou, Dan Rubenstein, Sambit Sahu