7 search results - page 2 / 2 » Efficient Concurrent Zero-Knowledge in the Auxiliary String ... |
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
ASE
2002
13 years 4 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...