Sciweavers

326 search results - page 22 / 66
» Digital Signature Scheme Based on a New Hard Problem
Sort
View
ASIACRYPT
1999
Springer
13 years 12 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
HICSS
2007
IEEE
116views Biometrics» more  HICSS 2007»
14 years 1 months ago
Fine-Grained and Scalable Approaches for Message Integrity
When we have multiple users compiling a single message, including shared contents, metadata, policy, and so on, the integrity of the contents created by individual users needs to ...
Joon S. Park, Ganesh Devarajan
WS
2003
ACM
14 years 25 days ago
An authentication framework for hierarchical ad hoc sensor networks
Recent results indicate scalability problems for flat ad hoc networks. To address the issue of scalability, self-organizing hierarchical ad hoc architectures are being investigat...
Mathias Bohge, Wade Trappe
CTRSA
2012
Springer
285views Cryptology» more  CTRSA 2012»
12 years 3 months ago
Plaintext-Checkable Encryption
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
Sébastien Canard, Georg Fuchsbauer, Aline G...
ASIACRYPT
2009
Springer
14 years 7 days ago
PSS Is Secure against Random Fault Attacks
A fault attack consists in inducing hardware malfunctions in order to recover secrets from electronic devices. One of the most famous fault attack is Bellcore’s attack against RS...
Jean-Sébastien Coron, Avradip Mandal