123
Voted
EUROCAST
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Given a basis of a vector space V over a field K and a multiplication table which defines a bilinear map on V , we develop a computer program on Mathematica which checks ...
110
Voted
CANS
2006
Springer
15 years 7 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...
131
Voted
ACSC
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...