169 search results - page 14 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
CSL
1999
Springer
13 years 12 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
CSFW
2010
IEEE
13 years 11 months ago
2010
IEEE
—Authorization logics allow concise specification of flexible access-control policies, and are the basis for logic-based access-control systems. In such systems, resource owner...
FOSSACS
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We propose a denotational semantics for the two-level language of [GJ91, Gom92], and prove its correctness w.r.t. a standard denotational semantics. Other researchers (se...
AOSD
2007
ACM
13 years 11 months ago
2007
ACM
Current implementations for aspect-oriented programming languages map the aspect-oriented concepts of source programs to object-oriented bytecode. This hinders execution environme...