146 Hits in 5.8 sec

Asymptotically Ideal CRT-based Secret Sharing Schemes for Multilevel and Compartmented Access Structures [article]

Ferucio Laurentiu Tiplea, Constantin Catalin Dragan
2018 IACR Cryptology ePrint Archive  
Based on this, we show that the proposed secret sharing schemes for multilevel and compartmented access structures are asymptotically ideal if and only if they are based on 1-compact sequences of co-primes  ...  Two main approaches have been taken so far: one of them is based on polynomial interpolation and the other one is based on the Chinese Remainder Theorem (CRT).  ...  The CRT-DMAS secret sharing scheme proposed by us (and based on compact sequences of co-primes) alleviates all the disadvantages mentioned above: • the scheme is based on compact sequences of co-primes  ... 
dblp:journals/iacr/TipleaD18 fatcat:53a4q7igpjfg5ldugsijumb4ey

Asymptotically ideal Chinese remainder theorem ‐based secret sharing schemes for multilevel and compartmented access structures

Ferucio Laurenţiu Ţiplea, Constantin Cătălin Drăgan
2021 IET Information Security  
Based on this, the proposed secret sharing schemes for multilevel and compartmented access structures are asymptotically ideal if and only if they are based on 1-compact sequences of co-primes.  ...  Possible applications for secret image and multi-secret sharing are pointed-out. security of the CRT-based secret sharing schemes through these concepts.  ...  Moreover, we have shown that this level of security can be achieved if and only if the schemes are based on 1-compact sequences of co-primes.  ... 
doi:10.1049/ise2.12014 fatcat:bwfbivqju5fnxhp7detunnu3bu

On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme

Constantin Cătălin Drăgan, Ferucio Laurentiu Tiplea
2018 Information Sciences  
sequences of co-primes in studying the security of the CRT-based secret sharing schemes.  ...  Thus, we show that this scheme is asymptotically ideal with respect to the uniform distribution on the secret space if and only of it is based on 1-compact sequences of co-primes.  ...  One of the applications of CRT is the design of threshold schemes [2, 1, 3] . In this paper we will focus on the threshold scheme in [1] and some of its variants.  ... 
doi:10.1016/j.ins.2018.06.046 fatcat:2dqepnf7obe5niaqlqzfbtdubm

Lossless (k,n)-Threshold Image Secret Sharing Based on the Chinese Remainder Theorem Without Auxiliary Encryption

Longlong Li, Yuliang Lu, Xuehu Yan, Lintao Liu, Longdan Tan
2019 IEEE Access  
We analyze the characteristics of images and ISS and propose a (k, n)-threshold CRTISS based on the Asmuth and Bloom's scheme by sharing the high 7 bits of a grayscale secret pixel and embedding the least  ...  A typical Chinese remainder theorem (CRT)-based secret sharing (SS) scheme has been proposed by Asmuth and Bloom for several decades, with lower computation complexity compared to Shamir's original polynomial-based  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their valuable comments and suggestions.  ... 
doi:10.1109/access.2019.2921612 fatcat:ayloobvisbhidonzhshfwpbsei

Practical MPC+FHE with Applications in Secure Multi-PartyNeural Network Evaluation [article]

Ruiyu Zhu, Changchang Ding, Yan Huang
2020 IACR Cryptology ePrint Archive  
This work explores a new approach to build threshold FHE (thereby MPC schemes) through tailoring generic MPC protocols to the base FHE scheme while requiring no effort in FHE redesign.  ...  We developed MPC protocols based on GMPFHE-CKKS and GMPFHE-GHS which are secure against any number of passive but colluding adversaries.  ...  We owe Nigel Smart and Shai Halevi for their super fast, thoughtful, detailed responses to our questions on HElib and the homomorphic computation of AES [55] .  ... 
dblp:journals/iacr/ZhuDH20 fatcat:htkdar6jfvgotjozmnc2miwxiy

Bootstrapping for HElib [chapter]

Shai Halevi, Victor Shoup
2015 Lecture Notes in Computer Science  
In that setting, the recryption procedure takes under 5.5 minutes (at security-level ≈ 76) on a single core, and allows a depth-9 computation before the next recryption is needed.  ...  So far, there have been precious few implementations of recryption, and fewer still that can handle "packed ciphertexts" that encrypt vectors of elements.  ...  The scheme is parametrized by a sequence of decreasing moduli q L q L−1 · · · q 0 , and an "ith level ciphertext" in the scheme is a vector ct ∈ (R q i ) 2 .  ... 
doi:10.1007/978-3-662-46800-5_25 fatcat:22fpwiurwrft5ovucrjj6aeoh4

Modeling For High Efficiency GaN/InGaN Solar Cell

Manoj Thosar
2013 IOSR Journal of Electrical and Electronics Engineering  
GaN/InGaN heterostructure contains a unique property of piezoelectric polarization charges at the interface due to different thermal expansion coefficients.  ...  The results obtained from the given model indicates that the piezoelectric polarization charges at the interface of Ga-face GaN/InGaN heterostructure improves the efficiency of a single GaN/InGaN heterostructure  ...  Acknowledgements We take this opportunity to thank our Head of Department Dr. A. D. Jadhav, and the entire Staff Members of E&TC (PG) department for their co-operation and help during this work.  ... 
doi:10.9790/1676-0410104 fatcat:cghl77irjjgplaxq7hbb5dflua

Multiparty Computation from Somewhat Homomorphic Encryption [chapter]

Ivan Damgård, Valerio Pastro, Nigel Smart, Sarah Zakarias
2012 Lecture Notes in Computer Science  
Our protocol consists of a preprocessing phase that is both independent of the function to be computed and of the inputs, and a much more efficient online phase where the actual computation takes place  ...  We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players.  ...  Concrete Instantiation of the Abstract Scheme based on LWE We now describe the concrete scheme, which is based on the somewhat homomorphic encryption scheme of Brakerski and Vaikuntanathan (BV) [7] .  ... 
doi:10.1007/978-3-642-32009-5_38 fatcat:iy5rabmo6fexvpb376pptcmxvm

A Tutorial Introduction to Lattice-based Cryptography and Homomorphic Encryption [article]

Yang Li, Kee Siong Ng, Michael Purcell
2022 arXiv   pre-print
The computational aspects of lattice-based cryptosystem are usually simple to understand and fairly easy to implement in practice. 3.  ...  Lattice-based cryptosystems enjoy strong worst-case hardness security proofs based on approximate versions of known NP-hard lattice problems. 5.  ...  We have defined ideal multiplication, it is natural to also define ideal division, provided ideals of O K does not include the zero ideal according to the definition. Theorem C.5.13.  ... 
arXiv:2208.08125v2 fatcat:awxvzfabbbhg3afk2jyzqlznaq

Efficient implementation of ideal lattice-based cryptography

Thomas Pöppelmann
2017 it - Information Technology  
One alternative is lattice-based cryptography which allows the construction of asymmetric public-key encryption and signature schemes that offer a good balance between security, performance, and key as  ...  AbstractAlmost all practically relevant asymmetric cryptosystems like RSA or ECC are either based on the hardness of factoring or on the hardness of the discrete logarithm problem.  ...  Moreover, it might make sense to investigate the applicability of the CRT in combination with the cached-NTT.  ... 
doi:10.1515/itit-2017-0030 fatcat:mpmamskk25h3lbyshy4rfd4y4y

RISQ-V: Tightly Coupled RISC-V Accelerators for Post-Quantum Cryptography

Tim Fritzmann, Georg Sigl, Johanna Sepúlveda
2020 Transactions on Cryptographic Hardware and Embedded Systems  
Compared to the pure software implementation on RISC-V, our co-design implementations show a speedup factor of up to 11.4 for NewHope, 9.6 for Kyber, and 2.7 for Saber.  ...  For the ASIC implementation, the energy consumption was reduced by factors of up to 9.5 for NewHope, 7.7 for Kyber, and 2.1 for Saber.  ...  Acknowledgments The authors want to thank the anonymous reviewers for their helpful comments and Paul Kohl who gave valuable input for the evaluation of the pq.mac function.  ... 
doi:10.13154/tches.v2020.i4.239-280 dblp:journals/tches/FritzmannSS20 fatcat:de76xdq25va2jabvfispmi53si

Physical Fault Injection and Side-Channel Attacks on Mobile Devices: A Comprehensive Analysis [article]

Carlton Shepherd, Konstantinos Markantonakis, Nico van Heijningen, Driss Aboulkassimi, Clément Gaine, Thibaut Heckmann, David Naccache
2021 arXiv   pre-print
In parallel, sophisticated SoC-assisted security mechanisms have become commonplace for protecting device data, such as trusted execution environments, full-disk and file-based encryption.  ...  We evaluate the prevailing methods, compare existing attacks using a common set of criteria, identify several challenges and shortcomings, and suggest future directions of research.  ...  The authors would like to thank the EXFILES WP5 project partners for comments and discussions around the topic of this work.  ... 
arXiv:2105.04454v5 fatcat:27ldfag7ejgvxh7cbs2qnevb24

Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh Networks

Rekha Patil
2013 IOSR Journal of Computer Engineering  
In this protocol, the source discovers multiple paths to the destination using parallel layer based approach.  ...  The approach makes use of Expected Forwarding Counter (EFW) metric to elect the primary path. We have evaluated the protocol using NS-2.  ...  Acknowledgement The author(s) would like to thank faculty members and other contributor for their very useful advises.  ... 
doi:10.9790/0661-1360107 fatcat:gd2ulyqagveodduiy7kgh6xena

Effect of Abiotic Stress on Crops [chapter]

Summy Yadav, Payal Modi, Akanksha Dave, Akdasbanu Vijapura, Disha Patel, Mohini Patel
2020 Sustainable Crop Production  
Proposed chapter will concentrate on enhancing plant response to abiotic stress and contemporary breeding application to increasing stress tolerance.  ...  Plants can initiate a number of molecular, cellular and physiological modifications to react to and adapt to abiotic stress. Crop productivity is significantly affected by drought, salinity and cold.  ...  For instance, up to 45% of the world's farming based land is encountered to frequent periods of time when there is scanty of rainfall in which 38% of the world's population resides and the world's mapped  ... 
doi:10.5772/intechopen.88434 fatcat:jegv2jfjx5blffhmbd6qq3hbki

Partial Key Exposure Attacks on BIKE, Rainbow and NTRU [article]

Andre Esser, Alexander May, Javier Verbel, Weiqiang Wen
2022 IACR Cryptology ePrint Archive  
We strongly question this belief by constructing partial key exposure attacks on code-based, multivariate, and latticebased schemes (BIKE, Rainbow and NTRU).  ...  As an example, for all schemes the knowledge of a constant fraction of the secret key bits suffices to reconstruct the full key in polynomial time.  ...  If a scheme uses n-bit keys and k ă n bits of information are leaked, then the scheme should offer the security of pn´kq-bit keys.  ... 
dblp:journals/iacr/EsserMVW22 fatcat:dzjzmrd7xnde5oz5fnr7ol5oja
« Previous Showing results 1 — 15 out of 146 results