Sciweavers

37 search results - page 8 / 8
» Certificateless undeniable signature scheme
Sort
View
ASIACRYPT
1999
Springer
13 years 9 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
CHES
2009
Springer
140views Cryptology» more  CHES 2009»
14 years 5 months ago
On Tamper-Resistance from a Theoretical Viewpoint
Tamper-proof devices are pretty powerful. They can be used to have better security in applications. In this work we observe that they can also be maliciously used in order to defea...
Paulo Mateus, Serge Vaudenay