Filters








723 Hits in 3.9 sec

Efficient Multiplicative Sharing Schemes [chapter]

Simon R. Blackburn, Mike Burmester, Yvo Desmedt, Peter R. Wild
1996 Lecture Notes in Computer Science  
The paper describes a new recursive construction for multiplicative threshold schemes which makes it possible to extend the number of users of such schemes for a relatively small expansion of the share  ...  The paper extends the Karnin-Greene-Hellman bound on the parameters of ideal secret sharing schemes t o schemes which are not necessarily ideal and then uses this as a yardstick t o compare the performance  ...  as a homomorphism from the set of n-tuples of shares to the set of keys.  ... 
doi:10.1007/3-540-68339-9_10 fatcat:it3jiznkr5gaznemkxr7yi3q34

Page 9001 of Mathematical Reviews Vol. , Issue 99m [page]

1999 Mathematical Reviews  
In fact, a homomorphic secret sharing scheme is a secret sharing scheme with a group structure on its secret space, and it can be applied to secret voting and shared signature.  ...  Frankel et al. developed homomorphic secret sharing schemes.  ... 

A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy

Slawomir Goryczka, Li Xiong
2017 IEEE Transactions on Dependable and Secure Computing  
We study secure multiparty addition protocols using well known security schemes: Shamir's secret sharing, perturbation-based, and various encryptions.  ...  A group of neighboring houses that share the same infrastructure could securely sum up their electrical usage, and apply privacy mechanisms to preserve privacy of the individual consumers (Fig. 1) .  ...  Acknowledgments The authors would like to thank Prof. Vaidy Sunderam for his insights and time spent on many extensive discussions.  ... 
doi:10.1109/tdsc.2015.2484326 pmid:28919841 pmcid:PMC5598559 fatcat:bzlmwjspazg2fjtt5vprz37a7e

Privacy preserving multimedia content identification for cloud based bag-of-feature architectures

Sviatoslav Voloshynovskiy, Maurits Diephuis, Taras Holotyak
2015 2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)  
We analytically model how geometric information can be used as a shared secret and derive the tradeoff between identification capability, privacy and computational load.  ...  In addition we suggest a descriptor ambiguization method that introduces uncertainty to the server with respect to the true interest of the data users.  ...  Our goal finally is not to propose a perfectly secure cryptographic solution but rather to underline the importance of geometric information and demonstrate a link to secret key sharing.  ... 
doi:10.1109/icmew.2015.7169799 dblp:conf/icmcs/VoloshynovskiyD15 fatcat:izpguxxpybgn7po2wj2fhj6kwu

Verifiable secret sharing for monotone access structures

Thomas Beth, Hans-Joachim Knobloch, Marcus Otten
1993 Proceedings of the 1st ACM conference on Computer and communications security - CCS '93  
In this paper we present a verifiable secret sharing scheme for a class of these geometry-based secret sharing schemes, which thus provides verifiable sharing of secrets according to general monotone access  ...  Simmons and others introduced secret sharing (also called shared control) schemes based on fiRite geometries, which allow istributing a secret according to any monotone access structure.  ...  In section 2 we briefly recall the geometry based secret sharing scheme which underlies our protocol. In section 3 we give a description of our approach.  ... 
doi:10.1145/168588.168612 dblp:conf/ccs/BethKO93 fatcat:tzhmbrpc6ndjdl5ysojkckl5wm

On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations [chapter]

Ronald Cramer, Ivan Damgård, Valerio Pastro
2012 Lecture Notes in Computer Science  
imagines n players that receive shares of his secret values and he must later reveal information to the verifier relating to these shares.  ...  We use a different approach, exploiting the homomorphic property of the commitment scheme to get a simpler and more efficient protocol with complexity logarithmic in n.  ...  However, it appears that the algebraic geometric approach can be extended so as to get a non-trivial improvement here as well, using more advanced techniques.  ... 
doi:10.1007/978-3-642-32284-6_4 fatcat:aogwrvixtvftha2gu5dxx55kky

A Peer-to-Peer Protocol and System Architecture for Privacy-Preserving Statistical Analysis [chapter]

Katerina Zamani, Angelos Charalambidis, Stasinos Konstantopoulos, Maria Dagioglou, Vangelis Karkaletsis
2016 Lecture Notes in Computer Science  
If such a scheme also possesses the homomorphism property, then multiple secrets can be combined by direct computation only on the shares.  ...  The Secure Summation Protocol Background Secret sharing schemes divide a secret into many shares which can be distributed to n mutually suspicious agents.  ... 
doi:10.1007/978-3-319-45507-5_16 fatcat:smha7wn37je2lfbxm5o5vsun6y

Permutation decoding of $${\mathbb {Z}}_2{\mathbb {Z}}_4$$ Z 2 Z 4 -linear codes

José Joaquín Bernal, Joaquim Borges, Cristina Fernández-Córdoba, Mercè Villanueva
2014 Designs, Codes and Cryptography  
Finally we show that there is also a heuristic randomized polynomial-time algorithm solving HSP 2 with high probability and so their original noise-free scheme is conjectured to be broken too.  ...  Permutation decoding is a technique, introduced in [3] by MacWilliams, that strongly depends on the existence of special subsets, called PD-sets, of the permutation automorphism group PAut(C) of a linear  ...  A secret sharing scheme is a method to protect a secret value by distributing it into shares among a set of players in order to prevent both the disclosure and the loss of the secret.  ... 
doi:10.1007/s10623-014-9946-4 fatcat:durd2s7zqbex7bu6abxbweq2ty

Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation [chapter]

Elette Boyle, Niv Gilboa, Yuval Ishai
2017 Lecture Notes in Computer Science  
More concretely, the approach of [BGI16] replaces the use of FHE by a 2-party homomorphic secret sharing (HSS) primitive, which turns out to be sufficient for the purpose of succinct secure two-party computation  ...  An HSS scheme is a secret sharing scheme that supports homomorphic computations on the shares, such that the output of the computation is compactly shared between the parties.  ...  Theorem 2.3 ([GGM86, Homomorphic Secret Sharing and DEHE As in [BGI16] , we consider the case of 2-out-of-2 secret sharing, where an algorithm Share is used to split a secret w ∈ {0, 1} n into two shares  ... 
doi:10.1007/978-3-319-56614-6_6 fatcat:bhgipsvgsvd53caixzg45iybem

Toward Practical Privacy-Preserving Analytics for IoT and Cloud-Based Healthcare Systems

Sagar Sharma, Keke Chen, Amit Sheth
2018 IEEE Internet Computing  
However, without appropriate privacy protection, conducting data analytics becomes a source of a privacy nightmare.  ...  Modern healthcare systems now rely on advanced computing methods and technologies, such as Internet of Things (IoT) devices and clouds, to collect and analyze personal health data at an unprecedented scale  ...  Shamir's secret sharing [13] allows dispersion of secrets amongst several parties such that the secrets can be revealed only when a threshold number of parties agree.  ... 
doi:10.1109/mic.2018.112102519 fatcat:g6hfa77dvvfvlpcfjxsasxecwq

Secure multiparty aggregation with differential privacy

Slawomir Goryczka, Li Xiong, Vaidy Sunderam
2013 Proceedings of the Joint EDBT/ICDT 2013 Workshops on - EDBT '13  
Security is guaranteed by secure multiparty computation protocols using well known security schemes: Shamir's secret sharing, perturbation-based, and various encryption schemes.  ...  Partial random noise is generated by all participants, which draw random variables from Gamma or Gaussian distributions, such that the aggregated noise follows Laplace distribution to satisfy differential  ...  The authors would also like to thank the anonymous reviewers for their valuable comments and suggestions to improve the quality of the paper.  ... 
doi:10.1145/2457317.2457343 dblp:conf/edbt/GoryczkaXS13 fatcat:oyinbvbjfbh37ei3pdiwweylqu

Secure Sum Computation using Threshold Encryption for Semi-Ideal Model

2020 International journal of recent technology and engineering  
In this scenario each of the parties has to provide its sensitive data for a common function evaluation. But, the parties may be worried about the misuse of the data.  ...  Here, we devise a new model and algorithm to compute sum of private data of mutually distrustful cooperating parties. We coin the term Semi-Ideal Model as it is hybrid of Ideal model and real model.  ...  We have used a TTP which generates public-private key pair using additive homomorphic cryptosystem of Pallier and also generate shares of the private key using Shamir's secret sharing threshold scheme.  ... 
doi:10.35940/ijrte.e6563.018520 fatcat:vxyelte4wrbtppeswsqvm7bvee

Page 7070 of Mathematical Reviews Vol. , Issue 93m [page]

1993 Mathematical Reviews  
It is a com- prehensive exposition of recent results on secret sharing schemes (excluding homomorphism schemes).  ...  [“On the size of shares for secret sharing schemes”, J. Cryptology, submitted]. M. V. D.  ... 

An Efficient Approach Based on Privacy-Preserving Deep Learning for Satellite Image Classification

Munirah Alkhelaiwi, Wadii Boulila, Jawad Ahmad, Anis Koubaa, Maha Driss
2021 Remote Sensing  
In this paper, we proposed a partially homomorphic encryption scheme (a Paillier scheme), which enables processing of confidential information without exposure of the underlying data.  ...  Our method achieves robust results when applied to a custom convolutional neural network (CNN) as well as to existing transfer learning methods.  ...  Also, the authors would like to acknowledge the support of Prince Sultan University for paying the Article Processing Charges (APC) of this publication.  ... 
doi:10.3390/rs13112221 fatcat:pjdbddrbt5a7pk3cjd2xf77eiq

Book Review: The geometry of schemes

Igor Dolgachev
2001 Bulletin of the American Mathematical Society  
The book is an elementary introduction to the theory of schemes. A scheme is a geometric object generalizing the notion of an algebraic variety.  ...  The book According to the authors, the goal of the book is "to share the secret geometry of schemes with the average mathematician and many a beginner in algebraic geometry."  ...  Its first chapter, devoted to classical algebraic geometry, occupies only 54 pages, which is hardly enough to build a good geometric intuition to fully appreciate the geometric nature of schemes.  ... 
doi:10.1090/s0273-0979-01-00911-9 fatcat:gudr5uxs3vc77bdbraq4qexequ
« Previous Showing results 1 — 15 out of 723 results