250 search results - page 1 / 50 » Fixed Argument Pairings |
LATINCRYPT
2010
13 years 3 months ago
2010
A common scenario in many pairing-based cryptographic protocols is that one argument in the pairing is fixed as a long term secret key or a constant parameter in the system. In th...
COMMA
2008
13 years 6 months ago
2008
Proposals for logic-based argumentation have the potential to be adapted for handling diverse kinds of knowledge. In this paper, a calculus for representing temporal knowledge is p...
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
NMR
2004
Springer
13 years 10 months ago
2004
Springer
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting a...
KR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...