204 search results - page 17 / 41 » On Provably Secure Time-Stamping Schemes |
118
Voted
CCS
1997
ACM
15 years 10 months 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...
167
click to vote
CCS
2010
ACM
15 years 6 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...
181
click to vote
PROVSEC
2009
Springer
16 years 16 days 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...
152
click to vote
ISPA
2005
Springer
15 years 11 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...
123
click to vote
PROVSEC
2009
Springer
16 years 16 days 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...