Abstract | ||
---|---|---|
Signcryption is a cryptographic primitive that provides confidentiality and authenticity simultaneously at a cost significantly lower than that of the naive combination of encrypting and signing the message. Threshold signcryption is used when a message to be sent needs the authentication of a certain number of members in an organisation, and until and unless a given number of members (known as the threshold) join the signcyption process, a particular message cannot be signcrypted. Threshold unsigncryption is used when this constraint is applicable during the unsigncryption process. In this work, we cryptanalyze two threshold unsigncryption schemes. We show that both these schemes do not meet the stringent requirements of insider security and propose attacks on both confidentiality and unforgeability. We also propose an improved identity based threshold unsigncryption scheme and give the formal proof of security in a new stronger security model. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1109/NSS.2010.99 | NSS |
Keywords | DocType | Volume |
security model,cryptographic primitive,delegation,message authentication,computational modeling,cryptography,random oracle model,bismuth,authentication,public key | Journal | 2010 |
Citations | PageRank | References |
2 | 0.37 | 9 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sharmila Deva Selvi | 1 | 138 | 23.41 |
Sree Vivek | 2 | 140 | 20.72 |
C. Pandu Rangan | 3 | 1434 | 149.57 |
S. Priti | 4 | 2 | 0.37 |