1401 search results - page 43 / 281 » Randomness in Interactive Proofs |
IACR
2011
13 years 9 months ago
2011
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
DCG
2007
14 years 9 months ago
2007
We consider polytopes in Rn that are generated by N vectors in Rn whose coordinates are independent subgaussian random variables. (A particular case of such polytopes are symmetri...
CC
2008
Springer
14 years 9 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
RSA
2006
14 years 9 months ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...