Sciweavers

1401 search results - page 28 / 281
» Randomness in Interactive Proofs
Sort
View
CORR
2006
Springer
77views Education» more  CORR 2006»
14 years 9 months ago
Generalized Entropy Power Inequalities and Monotonicity Properties of Information
New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of n ...
Mokshay M. Madiman, Andrew R. Barron
IJNSEC
2007
115views more  IJNSEC 2007»
14 years 9 months ago
Security Proof of the Original SOK-IBS Scheme
The identity-based signature (IBS) scheme proposed by Sakai, Ohgishi and Kasahara in 2000, which we refer to as the SOK-IBS scheme, is the first pairing-based IBS scheme. Though ...
Xiao-Ming Lu, Dengguo Feng
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
15 years 4 months ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
15 years 3 months ago
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...
STOC
1989
ACM
99views Algorithms» more  STOC 1989»
15 years 1 months ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Martin E. Dyer, Alan M. Frieze, Ravi Kannan