Long term confidentiality: a survey

Braun, Johannes; Buchmann, Johannes; Mullan, Ciaran; Wiesmaier, Alexander

doi:10.1007/s10623-012-9747-6

Cited by 24 publications

(11 citation statements)

References 95 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…10 It should be noted that it is difficult to obtain an optimal protocol from (6) because the number n, t, and the cardinalities jC 1 j; . .…”

Section: Information Reconciliationmentioning

confidence: 99%

“…Then, by using the above discussion, we have SðX; YkZÞ ! maxfIðX; YÞ À IðX; ZÞ; IðY; XÞ À IðY; ZÞ; 0g (10) obtained in [1], [15], and [31]. This implies that a secret-key agreement is possible with a positive generation rate when either IðX; YÞ > IðX; ZÞ or IðY; XÞ > IðY; ZÞ is satisfied.…”

Section: F Combination Of Information Reconciliation and Privacy Ampmentioning

confidence: 99%

“…By assuming that jM E j G jM AB j and I E G 1, the right-hand side of (12) is strictly positive. By applying (10) to the correlated random source ðX; Y; ZÞ we have the fact that secret-key distribution is possible with at least the rate given by the right-hand side of (12).…”

Section: Multiple Observation Attackmentioning

confidence: 99%

“…For instance, in the bounded storage model, the assumption that random bits can be broadcast in volumes that exceed available storage capacity is not currently realistic because very large storage is available. Such implementation difficulties in the above three models have been discussed in [10]. Correlated random numbers X; Y; Z of Alice, Bob, and Eve, respectively, are generated subject to the joint distribution p XYZ .…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Secret-Key Distribution Based on Bounded Observability

Muramatsu

Yoshimura²,

Davis³

et al. 2015

Proc. IEEE

View full text Add to dashboard Cite

The correlated observation of a common object by two users can be used to extract a secret key. This paper sheds light on this approach by the perspective of the bounded observability model.ABSTRACT | This paper reviews an approach to secret-key distribution based on the bounded observability (BO) model.First, the information-theoretic framework of secret-key agreement from a correlated random source is reviewed. Next, the BO model is introduced. In the context of this model, the BO condition is presented as a necessary and sufficient condition for the possibility of secret-key distribution. This condition describes limits on the information obtained by observation of a random object, and models the practical difficulty of completely observing random physical phenomena. Finally, an implementation of secret-key distribution based on BO in an optical fiber system is described.

show abstract

“…10 It should be noted that it is difficult to obtain an optimal protocol from (6) because the number n, t, and the cardinalities jC 1 j; . .…”

Section: Information Reconciliationmentioning

confidence: 99%

Section: F Combination Of Information Reconciliation and Privacy Ampmentioning

confidence: 99%

Section: Multiple Observation Attackmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Secret-Key Distribution Based on Bounded Observability

Muramatsu

Yoshimura²,

Davis³

et al. 2015

Proc. IEEE

View full text Add to dashboard Cite

show abstract

“…In recent years, cryptographers have been making efforts in the area of post-quantum computational cryptography [1][2][3][4][5][6]. They have also begun to construct alternative post-quantum (i.e., quantum-resistant) public key cryptosystems from other mathematically intractable problems [7][8][9][10][11][12][13].…”

Section: Introductionmentioning

confidence: 99%

Cryptanalysis of an asymmetric cipher protocol using a matrix decomposition problem

Liu

Zhang

Jia

et al. 2016

Sci. China Inf. Sci.

View full text Add to dashboard Cite

Algebraic techniques in slender-set differential cryptanalysis of PRESENT-like cipher SCIENCE CHINA Information Sciences 59, 099104 (2016); Cryptanalysis of a lattice based key exchange protocol SCIENCE CHINA Information Sciences 60, 028101 (2017); Rapid determination of thiabendazole in orange extract using excitation-emission matrix fluorescence and second-order calibration based on alternating trilinear decomposition/alternating normalization-weighted error algorithms Science in China Series B-Chemistry 51, 729 (2008);. RESEARCH PAPER. SCIENCE CHINA Information Sciences

show abstract

$$\mathsf {ELSA}$$ : Efficient Long-Term Secure Storage of Large Datasets

Geihs

Buchmann

2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

An increasing amount of information today is generated, exchanged, and stored digitally. This also includes long-lived and highly sensitive information (e.g., electronic health records, governmental documents) whose integrity and confidentiality must be protected over decades or even centuries. While there is a vast amount of cryptography-based data protection schemes, only few are designed for long-term protection. Recently, Braun et al. (AsiaCCS'17) proposed the first long-term protection scheme that provides renewable integrity protection and information-theoretic confidentiality protection. However, computation and storage costs of their scheme increase significantly with the number of stored data items. As a result, their scheme appears suitable only for protecting databases with a small number of relatively large data items, but unsuitable for databases that hold a large number of relatively small data items (e.g., medical record databases). In this work, we present a solution for efficient long-term integrity and confidentiality protection of large datasets consisting of relatively small data items. First, we construct a renewable vector commitment scheme that is information-theoretically hiding under selective decommitment. We then combine this scheme with renewable timestamps and informationtheoretically secure secret sharing. The resulting solution requires only a single timestamp for protecting a dataset while the state of the art requires a number of timestamps linear in the number of data items. We implemented our solution and measured its performance in a scenario where 12 000 data items are aggregated, stored, protected, and verified over a time span of 100 years. Our measurements show that our new solution completes this evaluation scenario an order of magnitude faster than the state of the art.This work has been co-funded by the DFG as part of project S6 within CRC 1119 CROSSING. A short version of this paper appears in the proceedings of ICISC'18.An overview of existing long-term integrity schemes is given by Vigil et al. in [25]. In contrast to integrity protection, confidentiality protection cannot be prolonged. There is no protection against an adversary that stores ciphertexts today, waits until the encryption is weakened, and then breaks the encryption and obtains the plaintexts. Thus, if long-term confidentiality protection is required, then strong confidentiality protection must be applied from the start. A very strong form of protection can be achieved by using information theoretically secure schemes, which are invulnerable to computational attacks. For example, key exchange can be realized using quantum key distribution [10], encryption can be realized using one-time pad encryption [23], and data storage can be realized using proactive secret sharing [14]. An overview of information theoretically secure solutions for long-term confidentiality protection is given by Braun et al. [4]. Recently, Braun et al. proposed LINCOS [3], which is the first long-term secure storage architecture t...

show abstract

Long term confidentiality: a survey

Cited by 24 publications

References 95 publications

Secret-Key Distribution Based on Bounded Observability

Secret-Key Distribution Based on Bounded Observability

Cryptanalysis of an asymmetric cipher protocol using a matrix decomposition problem

$$\mathsf {ELSA}$$ : Efficient Long-Term Secure Storage of Large Datasets

Contact Info

Product

Resources

About