Sciweavers

169 search results - page 21 / 34
» Which Languages Have 4-Round Zero-Knowledge Proofs
Sort
View
CCS
2007
ACM
14 years 1 months ago
Alpaca: extensible authorization for distributed services
Traditional Public Key Infrastructures (PKI) have not lived up to their promise because there are too many ways to define PKIs, too many cryptographic primitives to build them wi...
Chris Lesniewski-Laas, Bryan Ford, Jacob Strauss, ...
IPPS
2006
IEEE
14 years 1 months ago
A calculus of functional BSP programs with projection
Bulk Synchronous Parallel ML (BSML) is an extension of the functional language Objective Caml to program Bulk Synchronous Parallel (BSP) algorithms. It is deterministic, deadlock ...
Frédéric Loulergue
TACAS
2000
Springer
89views Algorithms» more  TACAS 2000»
13 years 11 months ago
The PROSPER Toolkit
Abstract. The Prosper (Proof and Specification Assisted Design Environments) project advocates the use of toolkits which allow existing verification tools to be adapted to a more f...
Louise A. Dennis, Graham Collins, Michael Norrish,...
TPHOL
2007
IEEE
14 years 1 months ago
Formalising Java's Data Race Free Guarantee
We formalise the data race free (DRF) guarantee provided by Java, as captured by the semi-formal Java Memory Model (JMM) [1] and published in the Java Language Specification [2]. ...
David Aspinall, Jaroslav Sevcík
KR
2010
Springer
14 years 10 days ago
Multi-Agent Only-Knowing Revisited
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
Vaishak Belle, Gerhard Lakemeyer