1401 search results - page 22 / 281 » Randomness in Interactive Proofs |
SIGCSE
1999
ACM
15 years 1 months ago
1999
ACM
We describe an approach for incorporating randomization in the teaching of data structures and algorithms. The proofs we include are quite simple and can easily
CRYPTO
2005
Springer
15 years 3 months ago
2005
Springer
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
We present an Identity Based Encryption (IBE) system that is fully secure in the standard model and has several advantages over previous such systems
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...