407 search results - page 14 / 82 » Malleable Proof Systems and Applications |
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
AMAI
2006
Springer
13 years 7 months ago
2006
Springer
Most real-world database applications manage temporal data, i.e., data with associated time references that capture a temporal aspect of the data, typically either when the data i...
SP
2009
IEEE
14 years 2 months ago
2009
IEEE
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
HICSS
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper provides a bound on the number of numeric operations (fixed or floating point) that can safely be performed before accuracy is lost. This work has important implic...