3552 search results - page 480 / 711 » Proof theory in the abstract |
191
click to vote
FUIN
2008
15 years 6 months ago
2008
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...
161
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
191
click to vote
IJFCS
2008
15 years 6 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
205
click to vote
JOC
2006
15 years 6 months ago
2006
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
157
click to vote
ENTCS
2007
15 years 6 months ago
2007
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...