5227 search results - page 329 / 1046 » Constructing New Media |
237
click to vote
FOCS
1990
IEEE
15 years 11 months ago
1990
IEEE
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...
169
Voted
CANS
2006
Springer
15 years 11 months ago
2006
Springer
We propose a new computational complexity assumption from bilinear map, based on which we construct Verifier-Local Revocation group signatures with shorter lengths than previous on...
181
Voted
ASIACRYPT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We describe two simple, efficient and effective credential pseudonymous certificate systems, which also support anonymity without the need for a trusted third party. The ...
167
click to vote
STOC
1995
ACM
15 years 11 months ago
1995
ACM
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-d...
158
click to vote
EUROCAL
1987
15 years 11 months ago
1987
Abstract. A new constructive method for finding all convenient moduli m for a number-theoretic transform with given length N and given primitive Nth root of unity modulo m is prese...