Handbook of Applied Cryptography

Menezes, Alfred; Oorschot, Paul C. van; Vanstone, Scott A.

doi:10.1201/9780429466335

Cited by 1,110 publications

(1,771 citation statements)

References 0 publications

Supporting

Mentioning

1,598

Contrasting

Unclassified

171

Order By: Relevance

“…Data splitting algorithms require combining all n shares of the split secret to reproduce the split information. If n − 1 shares are combined, information I will not be reproduced [8].…”

Section: Splitting and Sharing Algorithms For Secure Informationmentioning

confidence: 99%

Insider Threats and Cryptographic Techniques in Secure Information Management

Ogiela

2017

IEEE Systems Journal

View full text Add to dashboard Cite

This publication presents some techniques for insider threats and cryptographic protocols in secure processes. Those processes are dedicated to the information management of strategic data splitting. Strategic data splitting is dedicated to enterprise management processes as well as methods of securely storing and managing this type of data. Because usually strategic data are not enough secure and resistant for unauthorized leakage, we propose a new protocol that allows to protect data in different management structures. The presented data splitting techniques will concern cryptographic information splitting algorithms, as well as data sharing algorithms making use of cognitive data analysis techniques. The insider threats techniques will concern data reconstruction methods and cognitive data analysis techniques. Systems for the semantic analysis and secure information management will be used to conceal strategic information about the condition of the enterprise. Using the new approach, which is based on cognitive systems allow to guarantee the secure features and make the management processes more efficient.Index Terms-Cognitive systems, cryptographic data splitting algorithms, insider threats, secure information management.

show abstract

“…Data splitting algorithms require combining all n shares of the split secret to reproduce the split information. If n − 1 shares are combined, information I will not be reproduced [8].…”

Section: Splitting and Sharing Algorithms For Secure Informationmentioning

confidence: 99%

Insider Threats and Cryptographic Techniques in Secure Information Management

Ogiela

2017

IEEE Systems Journal

View full text Add to dashboard Cite

show abstract

“…Data privacy in Farsite is rooted in symmetric-key and public-key cryptography [27], and data reliability is rooted in replication. When a client writes a file, it encrypts the data using the public keys of all authorized readers of that file, and the encrypted file is replicated and distributed to a set of untrusted file hosts.…”

Section: Background -The Farsite File Systemmentioning

confidence: 99%

Reclaiming space from duplicate files in a serverless distributed file system

Douceur

Adya

Bolosky

et al.

Proceedings 22nd International Conference on Distributed Computing Systems

401

267

View full text Add to dashboard Cite

The Farsite distributed file system provides availability by replicating each file onto multiple desktop computers. Since this replication consumes significant storage space, it is important to reclaim used space where possible. Measurement of over 500 desktop file systems shows that nearly half of all consumed space is occupied by duplicate files. We present a mechanism to reclaim space from this incidental duplication to make it available for controlled file replication. Our mechanism includes 1) convergent encryption, which enables duplicate files to coalesced into the space of a single file, even if the files are encrypted with different users' keys, and 2) SALAD, a Self-Arranging, Lossy, Associative Database for aggregating file content and location information in a decentralized, scalable, fault-tolerant manner. Large-scale simulation experiments show that the duplicate-file coalescing system is scalable, highly effective, and fault-tolerant.

show abstract

“…An unconditionally trusted entity has access to all secret keys and must be trusted to protect these keys from compromise. [3] 9.Ei2-3 key KPs to create C. The receiver Bob decrypts the ciphertext message received from sender Alice by decrypting C with D and his private key KSB to obtain the original message M. Note that even though Alice created the encrypted message, she cannot decrypt it since she does not have access to Bob's private key; only Bob can decrypt C. Alice i P…”

Section: Asymmetric Cryptographymentioning

confidence: 99%

“…A functionally trusted entity is assumed to be trustworthy; however, unconditional trust is not required since this entity does not have access to the private keys. [3] user's public key bound to the identity of the key owner (e.g., Bob). Note that unlike symmetric key distribution, the CA may distribute public key certificates via an unprotected public channel.…”

Section: Figure 4 Asymmetric Cryptographymentioning

confidence: 99%

“…The EC problem is similar to the discrete logarithm, except that the equation y2=x3+ax+b mod p (an elliptic curve) is used in place of an exponential equation. With EC, unlike integer factorization and discrete logarithms, there are no known sub-exponential time algorithms, which facilitate crypt-analytic attacks based on algorithm running time for a given input [3]. Consequently, as shown in Table 2 [5], an EC key is an order-of-magnitude smaller than a computationally equivalent traditional asymmetric key.…”

Section: Elliptic Curve Cryptographymentioning

confidence: 99%

See 1 more Smart Citation

Efficient datalink security in a bandwidth-limited mobile environment - an overview of the Aeronautical Telecommunications Network (ATN) security concept

Olive

20th DASC. 20th Digital Avionics Systems Conference (Cat. No.01CH37219)

View full text Add to dashboard Cite

Handbook of Applied Cryptography

Cited by 1,110 publications

References 0 publications

Insider Threats and Cryptographic Techniques in Secure Information Management

Insider Threats and Cryptographic Techniques in Secure Information Management

Reclaiming space from duplicate files in a serverless distributed file system

Efficient datalink security in a bandwidth-limited mobile environment - an overview of the Aeronautical Telecommunications Network (ATN) security concept

Contact Info

Product

Resources

About