1401 search results - page 52 / 281 » Randomness in Interactive Proofs |
CSL
2010
Springer
14 years 10 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
ICISC
2003
14 years 11 months ago
2003
Abstract. It had been thought that it is difficult to provide receiptfreeness in mixnet-based electronic voting schemes. Any kind of user chosen randomness can be used to construct...
SOUPS
2009
ACM
15 years 4 months ago
2009
ACM
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...