204 search results - page 17 / 41 » On Provably Secure Time-Stamping Schemes |
CCS
1997
ACM
14 years 6 hour ago
1997
ACM
In this paper, we address the following problem: \ Is it possible to weaken/attack a scheme when a (provably) secure cryptosystem is used? ". The answer is yes. We exploit we...
CCS
2010
ACM
13 years 8 months ago
2010
ACM
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
PROVSEC
2009
Springer
14 years 2 months ago
2009
Springer
Signcryption is a cryptographic primitive that provides authentication and confidentiality simultaneously in a single logical step. It is often required that multiple senders have...
ISPA
2005
Springer
14 years 1 months ago
2005
Springer
Identity-based (ID-based) public key cryptosystem can be a good alternative for certificate-based public key setting, especially when efficient key management and moderate securit...
PROVSEC
2009
Springer
14 years 2 months ago
2009
Springer
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...