1401 search results - page 42 / 281 » Randomness in Interactive Proofs |
138
click to vote
TCC
2009
Springer
16 years 3 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
105
Voted
SCN
2010
Springer
15 years 1 months ago
2010
Springer
In this work, we consider Authentication and Key Agreement (AKA), a popular client-server Key Exchange (KE) protocol, commonly used in wireless standards (e.g., UMTS), and widely c...
110
click to vote
ECCC
2006
15 years 3 months ago
2006
Abstract. This article points out a gap between two natural formulations of the concept of a proof of knowledge, and shows that in all natural cases (e.g., NP-statements) this gap ...
115
click to vote
CASSIS
2004
Springer
15 years 8 months ago
2004
Springer
We present the Mobile Resource Guarantees framework: a system for ensuring that downloaded programs are free from run-time violations of resource bounds. Certificates are attached...
119
click to vote
ICFP
1999
ACM
15 years 7 months ago
1999
ACM
Programs are often structured around the idea that different pieces of code comprise distinct principals, each with a view of its environment. Typical examples include the module...