Sciweavers

13 search results - page 2 / 3
» Non-interactive Proofs for Integer Multiplication
Sort
View
GLOBECOM
2008
IEEE
14 years 6 days ago
Tight Bounds of the Generalized Marcum Q-Function Based on Log-Concavity
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...
Yin Sun, Shidong Zhou
JSW
2008
101views more  JSW 2008»
13 years 5 months ago
Broadcast Authentication with Practically Unbounded One-way Chains
A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains con...
Bogdan Groza
ICML
2010
IEEE
13 years 6 months ago
Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
Mingkui Tan, Li Wang, Ivor W. Tsang
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
14 years 6 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
EUROCRYPT
1999
Springer
13 years 10 months ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Jan Camenisch, Markus Michels