A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We present a novel method for constructing linear secret sharing schemes (LSSS) from linear error correcting codes and linear universal hash functions in a blackbox way. ... Choosing the error correcting codes and universal hash functions involved carefully, we obtain solutions to the following open problems: -A linear near-threshold secret sharing scheme with both linear ... We would also like to thank Ignacio Cascudo and Irene Giacomelli for helpful discussions and comments. ...doi:10.1007/978-3-662-46803-6_11 fatcat:vile6f3f6zduxgy66y42j66bi4
We thus finally obtain a fully explicit and robust secret sharing scheme in this model that is essentially optimal in all parameters including the share size which is k(1 + o(1)) + O(κ), where k is the ... secret length and κ is the security parameter. ... chosen linear hash function. ...doi:10.1109/isit.2016.7541751 dblp:conf/isit/Cheraghchi16 fatcat:7ojc5kegxnhcxfnrom6hpbyf4e
For this setting we propose efficient and throughput-optimal error correction schemes, provided that the source and terminals share randomness that is secret form the adversary. ... In contrast to traditional network error correction codes designed for a given network capacity and a given number of errors, we study an arguably more realistic setting that prior knowledge on the network ... We design the rateless network error correction code first under the assumption that the source and terminals share random bits which are secret from the adversary. ...doi:10.1109/isit.2015.7282931 dblp:conf/isit/HuangWHJS15 fatcat:qp26vf2ulfabdbfyniaw5xuq7i
Beyond that, we employ the best known list decoding algorithms for Reed-Solomon codes and show that, with high probability, only the correct secret maintains the correct information-theoretic tag if an ... We thus obtain a fully explicit and robust secret sharing scheme in this model that is essentially optimal in all parameters including the share size which is k(1 + o(1)) + O(κ), where k is the secret ... reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. ...doi:10.1007/s10623-018-0578-y fatcat:jl6b7qtz2nbp7ppygbja3tvy2m
The paper surveys applications of finite fields to error-correcting codes. It starts from an introduction giving the basic notions of information theory and error-correcting codes. ... Blakley and G. A. Kabatianski, On general perfect secret sharing schemes (367-371). Bruce Dodson and Arjen K. ...
Lecture Notes in Computer Science
In this paper, we consider three very important issues namely detection, identification and robustness of k-out-of-n secret sharing schemes against rushing cheaters who are allowed to submit (possibly ... Among these, first we present two k-out-of-n secret sharing schemes, the first one being capable of detecting (k − 1)/3 cheaters such that |Vi| = |S|/ 3 and the second one being capable of detecting n ... Acknowledgments The research of A.A. and P. S ...doi:10.1007/978-3-319-49175-2_1 fatcat:l7t4k3f2mbcu7i5au2darjemdu
Compared with the universal hashing function, the proposed scheme does not need other random sources, and the randomness can be completely provided by the qubit string. ... In this paper, we propose a privacy amplification scheme based on composite coding, which is an extension of quantum CSS codes to classical linear codes. ... The generalized privacy amplification is realized by means of universal hashing function, where an auxiliary random source is needed to randomly select a hashing function from the universal class [5, ...arXiv:2109.07139v1 fatcat:v3fwke6opfe6vbii3wbuk5ulma
The information rate of a secret sharing scheme is defined to be the ratio between the size of secret and the maximum size of the shares. ... Summary: “A secret sharing scheme is a method which allows a secret to be shared among a set of participants in such a way 94 INFORMATION AND COMMUNICATION, CIRCUITS 7264 that only qualified subsets of ...
ISBN 90-74445-30-6 From the introduction: “This thesis deals with the design and analysis of error-correcting codes. ... -256); Willi Geiselmann, A note on the hash function of Tillich and Zémor (257-263); Pascal Véron, Crypt- analysis of Harari’s identification scheme (264-269); T. ...
Lecture Notes in Computer Science
(TCC 2015) and of Cheraghchi and Guruswami (TCC 2014) and improves the previous result in the bit-wise tampering model: it builds the first non-malleable codes with linear-time complexity and optimal-rate ... Non-malleable codes were introduced by Dziembowski et al. (ICS 2010) as coding schemes that protect a message against tampering attacks. ... To obtain this, we also use the recent results about linear-time encodable error-correcting codes and linear-time computable universal hash functions [IKOS08, DI14] . ...doi:10.1007/978-3-319-72089-0_1 fatcat:can3cd3rdnhy5kyvsqtdqotn5m
Our work also includes a security comparison between our improved scheme and different code-based RFID authentication schemes. ... In this paper, we found that this scheme does not provide untraceability and forward secrecy properties. ... RELATED WORKS RFID authentication schemes based on error-correcting codes use various schemes: error-correcting code with secret parameters , randomized McEliece cryptosystem , randomized ...doi:10.5815/ijcnis.2015.09.01 fatcat:trvmb2xdoveupclinx44erggki
At the end of this study, the authors prove the security of the proposed scheme and compare it with other secret sharing schemes. 4 IET Inf. Secur. ... In this study, a novel outsourcing secret sharing scheme is proposed. ... Acknowledgments This work was supported by the National Natural Science Foundation of China (U1604156, 61602158), and Science and Technology Research Project of Henan Province (172102210045). ...doi:10.1049/iet-ifs.2017.0026 fatcat:pzfk3zz6wnfbnckseb4ngrs4ri
We look at four areas in cryptography: secrecy codes, authentication codes, secret sharing schemes, and resilient func- tions. ... The primary interest of this code is the set of errors corrected by the code. ...
Communications in Computer and Information Science
In this paper we introduce and provide a formal definition of the notion of secret locking which generalizes a previously introduced concept for cryptographic key extraction from biometrics. ... In addition, we introduce an extended framework to analyze the security of the scheme. ... Acknowledgements The authors would like to thank Fabian Monrose and Mike Reiter for helpful discussions and suggestions throughout this work. ...doi:10.1007/978-3-540-75993-5_9 fatcat:7fiw2gflyveldpbubaad2ao5cm
This report documents the program and the outcomes of Dagstuhl Seminar 18511 "Algebraic Coding Theory for Networks, Storage, and Security". ... The ever increasing traffic in networks and the growth of distributed storage systems require advanced techniques based on algebraic coding to meet user demand. ... This paper uses hash functions to identify which shares were corrupted by the adversary, and then erasure decoding in the valid shares to recover the secret. ...doi:10.4230/dagrep.8.12.49 dblp:journals/dagstuhl-reports/ByrneBW18 fatcat:qmcdjxigx5ahxe3jpnmns4v6ka
« Previous Showing results 1 — 15 out of 2,808 results