2010 International Conference on Computer and Communication Technology (ICCCT) 2010
DOI: 10.1109/iccct.2010.5640483
|View full text |Cite
|
Sign up to set email alerts
|

Security Vs cost: An issue of multi-objective optimization for choosing PGP algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…For example, a user can download a program installer from the internet and verify its hash value to check whether the installer is complete and has not been corrupted or altered by a malicious attacker. Another use case is cryptographic hash functions in PGP [56,57], where a sender wants to send a message to the intended receivers, and the receivers want to verify the authenticity of the message. To ensure the integrity of the message and reduce computational costs, a digest of the message is computed and signed using the sender's private key, which is called the "signature," instead of signing the whole message.…”
Section: Cryptographic Hash Functionmentioning
confidence: 99%
“…For example, a user can download a program installer from the internet and verify its hash value to check whether the installer is complete and has not been corrupted or altered by a malicious attacker. Another use case is cryptographic hash functions in PGP [56,57], where a sender wants to send a message to the intended receivers, and the receivers want to verify the authenticity of the message. To ensure the integrity of the message and reduce computational costs, a digest of the message is computed and signed using the sender's private key, which is called the "signature," instead of signing the whole message.…”
Section: Cryptographic Hash Functionmentioning
confidence: 99%
“…In order to ensure the security of data, a unified and indiscriminate encryption storage method is currently used, which causes the waste of computing resources and time and fails to ensure high security requirements. Therefore, the storage of data must be balanced between security requirements and performance requirements [12].…”
Section: Related Researchmentioning
confidence: 99%
“…A bitwise compression algorithm, however, is not constrained by lack of byte alignment. It will be able to see repeating literals or <length, distance> pairs (Kumar et al, 2010). For these reasons we are going to use zpaq as our for compressing our file fragments.…”
Section: Testing Compressibilitymentioning
confidence: 99%