Filters








107 Hits in 4.7 sec

The Development of Proxy Re-Encryption

Yepeng Liu, Yongjun Ren, Qirun Wang, Jinyue Xia
<span title="">2020</span> <i title="Computers, Materials and Continua (Tech Science Press)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/i2s3d3neyzhork7b7uapnqri5q" style="color: black;">Journal of Cyber Security</a> </i> &nbsp;
This paper elaborates on the definition, characteristics and development status of proxy re-encryption, and classifies proxy re-encryption from the perspectives of user identity, conversion condition,  ...  The aspects of the existing program were compared and briefly reviewed from the aspects of features, performance, and security.  ...  Acknowledgment: This work is supported by the NSFC (Nos. 61772280, 61702236), the Changzhou Sci & Tech Program (No. CJ20179027), and the PAPD fund from NUIST. Prof.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.32604/jcs.2020.05878">doi:10.32604/jcs.2020.05878</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4n6e6v2khfhpzbpf4vufp7tlsy">fatcat:4n6e6v2khfhpzbpf4vufp7tlsy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220302091544/http://www.techscience.com/uploads/attached/file/20200617/20200617081117_86289.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a9/7b/a97b476af49ee3a4275f487c655f3d3a01720ef1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.32604/jcs.2020.05878"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

An Efficient and Secure Data Sharing Method Using Asymmetric Pairing with Shorter Ciphertext to Enable Rapid Learning in Healthcare

Snehlata Yadav, Namita Tiwari, Vijay Kumar
<span title="2022-04-20">2022</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3wwzxqpotbc73bzpemzybzg7ee" style="color: black;">Computational Intelligence and Neuroscience</a> </i> &nbsp;
The standard broadcast encryption system is inefficient for this purpose.  ...  In the present scenario, COVID-19 data is sensitive and must be encrypted to ensure data privacy. Secure sharing of such information is crucial.  ...  key of recipients and to ciphertext transmitted among subscribers. e first optimal IBBE scheme [13] has been constructed from pairings and learning with errors (LWE). (2) Attribute-based broadcast encryption  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2022/4788031">doi:10.1155/2022/4788031</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/35463282">pmid:35463282</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC9021993/">pmcid:PMC9021993</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/plgyvh4reza2bjjcuczrjvaory">fatcat:plgyvh4reza2bjjcuczrjvaory</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220427002335/https://downloads.hindawi.com/journals/cin/2022/4788031.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ba/e3/bae3090e0d93305249922fc98e08924758dc18d0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2022/4788031"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9021993" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

LRSPPP: lightweight R-LWE-based secure and privacy-preserving scheme for prosumer side network in smart grid

Aarti Amod Agarkar, Himanshu Agrawal
<span title="2019-03-12">2019</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ifjemtdanzevfbtz3nv7p24qjm" style="color: black;">Heliyon</a> </i> &nbsp;
In this paper, we attempt to address the security and privacy issues at the prosumer side of smart grid network. Our work is different from the previous works in two ways.  ...  There is no previous evidence of use of R-LWE based encryption for prosumer's privacy protection in smart grid.  ...  R-LWE reduces the space requirement as each sample from R-LWE distribution can replace n samples from standard LWE distribution; which reduces the secret key size and public key size by factor of n.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.heliyon.2019.e01321">doi:10.1016/j.heliyon.2019.e01321</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/30911691">pmid:30911691</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC6416661/">pmcid:PMC6416661</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n7g7kavgbbdprikc3j2vm7fr5a">fatcat:n7g7kavgbbdprikc3j2vm7fr5a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200305185146/https://researchbank.swinburne.edu.au/file/15266f48-4621-4b2f-915a-d9f8998ab94a/1/2019-agarkar-lrsppp_lightweight.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/df/29/df29934268f9f70f4f0a1d3bd86ecc0e5188bfa2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.heliyon.2019.e01321"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6416661" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Quantum-Safe Group Key Establishment Protocol from Lattice Trapdoors

Teklay Gebremichael, Mikael Gidlund, Gerhard P. Hancke, Ulf Jennehag
<span title="2022-05-30">2022</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/taedaf6aozg7vitz5dpgkojane" style="color: black;">Sensors</a> </i> &nbsp;
In most instances, a group message needs to be encrypted using a cryptographic key that only devices in the group know.  ...  The protocol also incorporates a mechanism for node addition and session-key generation in a forward- and backward-secrecy-preserving manner.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/s22114148">doi:10.3390/s22114148</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/35684771">pmid:35684771</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ffxmzzhzbbesrltvxjnezmhznm">fatcat:ffxmzzhzbbesrltvxjnezmhznm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220608195708/https://mdpi-res.com/d_attachment/sensors/sensors-22-04148/article_deploy/sensors-22-04148.pdf?version=1653907365" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d1/7a/d17ad8c0176031412de05fac78c4d3ce47a9ffd0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/s22114148"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Two Round Multiparty Computation via Multi-key FHE [chapter]

Pratyay Mukherjee, Daniel Wichs
<span title="">2016</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We construct a general multiparty computation (MPC) protocol with only two rounds of interaction in the common random string model, which is known to be optimal.  ...  In the honestbut-curious setting we only rely on the learning with errors (LWE) assumption, and in the fully malicious setting we additionally assume the existence of non-interactive zero knowledge arguments  ...  Acknowledgments We thank Antigoni Polychroniadou for her helpful comments and helping us find and fix a subtle error with the extended MPC protocol given in a previous version of this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-49896-5_26">doi:10.1007/978-3-662-49896-5_26</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ylnb3mzo4bbu3douzogbugxqwu">fatcat:ylnb3mzo4bbu3douzogbugxqwu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170716185004/https://eprint.iacr.org/2015/345.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b6/96/b6964d3aea9833e78bf1b69ac34e02fbceae1e1b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-49896-5_26"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS [chapter]

Eunkyung Kim, Hyang-Sook Lee, Jeongeun Park
<span title="">2018</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Therefore, we resolve the issue by constructing an MFHE scheme without CRS based on LWE assumption, and then we obtain a secure MPC protocol against semi-malicious security in three rounds.  ...  In EUROCRYPT 2016, Mukherjee and Wichs constructed a secure MPC protocol in only two rounds via MFHE which deals with a common random/reference string (CRS) in key generation.  ...  Mehdi Tibouchi for his helpful comment in this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-93638-3_7">doi:10.1007/978-3-319-93638-3_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fvjhrnbcrzgjzcfkoyzf3lrzsq">fatcat:fvjhrnbcrzgjzcfkoyzf3lrzsq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190225234018/http://pdfs.semanticscholar.org/65cb/d2ad242973f362d9affdb7ce56a9e4bb6079.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/65/cb/65cbd2ad242973f362d9affdb7ce56a9e4bb6079.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-93638-3_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Efficient Scalable Constant-Round MPC via Garbled Circuits [chapter]

Aner Ben-Efraim, Yehuda Lindell, Eran Omri
<span title="">2017</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Our constructions use key-homomorphic pseudorandom functions (one based on DDH and the other on Ring-LWE) and are concretely efficient.  ...  In particular, for a large number of parties (e.g., 100), our new circuit can be evaluated faster than the standard BMR garbled circuit that uses only AES computations.  ...  Acknowledgements We would like to thank Shalev Keren, Moria Farbstein and Lior Koskas for helping with the code, and to thank Shai Halevi and Vadim Lyubashevsky for helpful discussions on LWE.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-70697-9_17">doi:10.1007/978-3-319-70697-9_17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cysaevum25bafk56zdb6b4x5gq">fatcat:cysaevum25bafk56zdb6b4x5gq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190217134401/http://pdfs.semanticscholar.org/05a6/887c6142326263cd32304e222f22e35bff17.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/05/a6/05a6887c6142326263cd32304e222f22e35bff17.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-70697-9_17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Four Round Secure Computation Without Setup [chapter]

Zvika Brakerski, Shai Halevi, Antigoni Polychroniadou
<span title="">2017</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We construct a 4-round multi-party computation protocol in the plain model for any functionality, secure against a malicious adversary.  ...  To do this, we construct an LWE based multi-key FHE scheme with a very simple one-round distributed setup procedure (vs. the trusted setup required in previous LWE based constructions).  ...  Each party generates a public/secret key-pair for the multi-key FHE, encrypts its input under these keys, and broadcasts the public key and ciphertext. Round 3: Partial Decryption.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-70500-2_22">doi:10.1007/978-3-319-70500-2_22</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vesul2pae5drzbfmwihdycqca4">fatcat:vesul2pae5drzbfmwihdycqca4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170714171828/https://eprint.iacr.org/2017/386.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/95/a2/95a2d13cca0c33020af8c71599b2cbeb94809b35.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-70500-2_22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Secure Sum Outperforms Homomorphic Encryption in (Current) Collaborative Deep Learning [article]

Derian Boer, Stefan Kramer
<span title="2021-10-25">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The predominant scheme for this is based on homomorphic encryption (HE), and it is widely considered to be without alternative.  ...  in terms of both collusion-resistance and runtime.  ...  Acknowledgements This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2006.02894v2">arXiv:2006.02894v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qs4jwss4jrhefbfc5nufhdxr6q">fatcat:qs4jwss4jrhefbfc5nufhdxr6q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200825034226/https://arxiv.org/pdf/2006.02894v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f6/ed/f6edbae07150d6dfbfbe0e1001ca12868815a4ed.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2006.02894v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE) [chapter]

Ivan Damgård, Antigoni Polychroniadou, Vanishree Rao
<span title="">2016</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We also build adaptively secure UC commitments and UC zero-knowledge proofs (of knowledge) from LWE.  ...  (ACM 2012), and LWE as mentioned above our adaptive protocols run in three rounds. Our protocols are constructed based on a special type of cryptosystem we call equivocal FHE from LWE.  ...  Using the composition theorem and [CF01, Theorem 5], we can instantate F Com with the UC commitment protocol from LWE (see Section 4) in the CRS model and realize F ZK from LWE.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-49387-8_9">doi:10.1007/978-3-662-49387-8_9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/46jex2xuwzdipo2aa2y7e62whq">fatcat:46jex2xuwzdipo2aa2y7e62whq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160612014959/https://eprint.iacr.org/2014/830.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b8/95/b8957a85d1a56bb8690fefa6e5d4982a28ed1055.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-49387-8_9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys

Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters
<span title="">2015</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7dys7zoberdktmxyjciuy5bnse" style="color: black;">SIAM journal on computing (Print)</a> </i> &nbsp;
These include protocols for secure multiparty computation and for non-interactive verifiable computation in the preprocessing model which achieve, for the first time, an optimal online communication complexity  ...  More concretely, the online part x consists of an n-bit string and a single encryption key.  ...  The first author was supported by Alon Fellowship, ISF grant 1155/11, Israel Ministry of Science and Technology (grant 3-  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/130929643">doi:10.1137/130929643</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pwv2vdym4jeptaawxgca2pygxe">fatcat:pwv2vdym4jeptaawxgca2pygxe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150318075214/http://eprint.iacr.org/2012/693.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1e/b6/1eb65e471b5aa9a896c10c4255f609f87cdf2c75.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/130929643"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Secure and Efficient Multi-Authority Attribute-Based Encryption Scheme From Lattices

Yuan Liu, Licheng Wang, Lixiang Li, Xixi Yan
<span title="">2019</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q7qi7j4ckfac7ehf3mjbso4hne" style="color: black;">IEEE Access</a> </i> &nbsp;
Thus, we proposed a security and efficient multi-authority ABE scheme from lattices in this paper. The scheme is based on the theory of MP12 and is proved to be secure under the standard model.  ...  The analysis shows that our scheme is feasible and superior in the large-scale distributed environment. INDEX TERMS Learning with errors, MA-ABE, MP12, optimized sampling algorithm, standard model.  ...  OUR CONTRIBUTION In this paper, we presented a security and efficient MA-ABE scheme from lattices which is secure in the standard model, more efficient in communication cost and support any access policy  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/access.2018.2888850">doi:10.1109/access.2018.2888850</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rv4jdfwc2fdqxmicp6esmwwvoq">fatcat:rv4jdfwc2fdqxmicp6esmwwvoq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201108180102/https://ieeexplore.ieee.org/ielx7/6287639/8600701/08584433.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7c/59/7c5929547bbc3279ff70f2703086e65b8ac700f1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/access.2018.2888850"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> ieee.com </button> </a>

Efficient Lattice CP-ABE AC Scheme Supporting Reduced-OBDD Structure for CCN/NDN

Affum, Zhang, Wang, Ansuura
<span title="2020-01-14">2020</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nzoj5rayr5hutlurimhzyjlory" style="color: black;">Symmetry</a> </i> &nbsp;
The proposed scheme is proved to be secure and efficient under the decision ring LWE problem in the selective set model.  ...  Hence, we propose the ciphertext policy attribute based encryption access control (CP-ABE AC) scheme from a lightweight ideal lattice based on ring learning with error (R-LWE) problem, and demonstrated  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/sym12010166">doi:10.3390/sym12010166</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3xbp35ztujfa3gxoe4ctgekpei">fatcat:3xbp35ztujfa3gxoe4ctgekpei</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200212013232/https://res.mdpi.com/d_attachment/symmetry/symmetry-12-00166/article_deploy/symmetry-12-00166-v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b0/5c/b05cbd036818e059cf6db207fcae4ca960e08c43.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/sym12010166"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes [chapter]

Dan Boneh, Sam Kim, Valeria Nikolaenko
<span title="">2017</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Double authentication preventing signatures (DAPS) is a mechanism, due to Poettering and Stebila, for protecting certificate authorities (CAs) from coercion.  ...  The k conflicting messages can be signed at different times and the signatures may be generated independently of one another.  ...  As in Section 4, we first describe a broadcast encryption scheme from the variant of the dual-Regev encryption scheme and then present our MADAPS construction using the broadcast encryption scheme.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-61204-1_23">doi:10.1007/978-3-319-61204-1_23</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3hsepbzmwvc25avxol7dgdbnom">fatcat:3hsepbzmwvc25avxol7dgdbnom</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171211054809/https://crypto.stanford.edu/~skim13/papers/daps.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/87/05/8705370d5668bd3e19edecb0fda7f73714d3f0d4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-61204-1_23"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys [chapter]

Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters
<span title="">2013</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
These include protocols for secure multiparty computation and for non-interactive verifiable computation in the preprocessing model which achieve, for the first time, an optimal online communication complexity  ...  More concretely, the online part x consists of an n-bit string and a single encryption key.  ...  (The security of the construction follows from standard assumptions only when the input x is picked by the client independently of pk [10] .) This connection was generalized and optimized in [6] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-40084-1_10">doi:10.1007/978-3-642-40084-1_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e4bhvkik3vcpfccot3c6omgvtq">fatcat:e4bhvkik3vcpfccot3c6omgvtq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130624013907/http://eprint.iacr.org/2012/693.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/be/23/be23b20cbc1f97ea9d651abfec7a581e56f89a2d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-40084-1_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 107 results