More efficient privacy amplification with less random seeds

Hayashi, Masahito; Tsurumaru, Toyohiro

doi:10.1109/isit.2015.7282763

Cited by 7 publications

(7 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We remark that the construction of Dodis et al [DEOR04] is based on universal hash functions. These are already known to be good quantum-proof seeded extractors [RK05,TSSR11,HT15]. Recently, Hayashi and Tsurumaru [HT15] proved that they are also good quantum-proof extractors if the seed is not uniform.…”

Section: Lemma 20 ([Deor04]mentioning

confidence: 99%

“…These are already known to be good quantum-proof seeded extractors [RK05,TSSR11,HT15]. Recently, Hayashi and Tsurumaru [HT15] proved that they are also good quantum-proof extractors if the seed is not uniform. Using some of our proof techniques, the result of Hayashi and Tsurumaru can be generalised to obtain a different proof that the construction of Dodis et al is a two-source extractor in the Markov model.…”

Section: Lemma 20 ([Deor04]mentioning

confidence: 99%

“…In the quantum case, it was further shown in [KT08] that all one-bit output extractors remain secure. It is still unknown whether all multi-bit output extractors remain secure (although the results of [BFS14,BFS16] go in this direction 1 ), but several constructions of seeded extractors with good parameters were shown to work also in the presence of quantum side information [RK05,TSSR11,DPVR12,HT15].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Quantum-proof multi-source randomness extractors in the Markov model

Arnon-Friedman,

Portmann,

Scholz

2015

Preprint

View full text Add to dashboard Cite

Randomness extractors, widely used in classical and quantum cryptography and other fields of computer science, e.g., derandomization, are functions which generate almost uniform randomness from weak sources of randomness. In the quantum setting one must take into account the quantum side information held by an adversary which might be used to break the security of the extractor. In the case of seeded extractors the presence of quantum side information has been extensively studied. For multi-source extractors one can easily see that high conditional min-entropy is not sufficient to guarantee security against arbitrary side information, even in the classical case. Hence, the interesting question is under which models of (both quantum and classical) side information multi-source extractors remain secure. In this work we suggest a natural model of side information, which we call the Markov model, and prove that any multi-source extractor remains secure in the presence of quantum side information of this type (albeit with weaker parameters). This improves on previous results in which more restricted models were considered or the security of only some types of extractors was shown.

show abstract

Section: Lemma 20 ([Deor04]mentioning

confidence: 99%

Section: Lemma 20 ([Deor04]mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Quantum-proof multi-source randomness extractors in the Markov model

Arnon-Friedman,

Portmann,

Scholz

2015

Preprint

View full text Add to dashboard Cite

show abstract

“…A claiming message is the message that provides the identity and the location of a neighbor node which is the examinee of the observer. The observer sends this claiming message over the overlay network attached with a key, which is the hash of the identity of the examinee concatenated with the random seed [17]. The destination to which this message must be sent is decided based on the key valued attached.…”

Section: Distributed Detection Protocolmentioning

confidence: 99%

Node clone detection using a stable overlay network

Chelliah

Vigil

Praba

2020

IJECE

View full text Add to dashboard Cite

Wireless sensor networks consist of number of sensor nodes widely distributed in particular region to communicate and sharing the environmental information and also these data’s are stored in central location for further data prediction. Such nodes are susceptible to cloning attack where the adversary captures a node, replicates with the same identity as that of the captured node and deploys the clone back into the network, causing severe harm to the network. Hence to thwart such attacks, a distributed detection protocol is used with initiator-observer-inspector roles assigned randomly for the nodes to witness the clone and thereby broadcast the evidence through a balanced overlay network. Use of such balanced network provides high security level and reduces the communication cost when compared to other overlay networks with a reasonably less storage consumption.

show abstract

“…We thus demand the extractor's output to be uniform with respect to the side information. There are lots of research on strong extractor in the presence of classical or quantum side information [17][18][19][20][21][22] . But for non-malleable extractor, little is known about the security in the presence of side information.…”

Section: Introductionmentioning

confidence: 99%