scientific article
From MaRDI portal
Publication:3778674
zbMath0637.94013MaRDI QIDQ3778674
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Conducting secret ballot elections in computer networks: Problems and solutions, Best possible information-theoretic MPC, Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model, Computing in social networks, How to share a secret with cheaters, Abelian sharing, common informations, and linear rank inequalities, Summing over a network without revealing summands, A survey and refinement of repairable threshold schemes, Graph coloring applied to secure computation in non-abelian groups, Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography, Privacy-preserving ridge regression on distributed data, An Efficient and Provably Secure Private Polynomial Evaluation Scheme, Homomorphic extensions of CRT-based secret sharing, Tight bounds on the randomness complexity of secure multiparty computation, Homomorphic secret sharing for low degree polynomials, Foundations of Homomorphic Secret Sharing, A verifiable threshold secret sharing scheme based on lattices, Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing, Efficient VSS free of computational assumption, Decentralized polling with respectable participants, Multi-party computation with conversion of secret sharing, On group-characterizability of homomorphic secret sharing schemes, On ideal homomorphic secret sharing schemes and their decomposition, Benaloh’s Dense Probabilistic Encryption Revisited, Comments on Harn-Lin's cheating detection scheme, A communication-privacy tradeoff for modular addition, A pairing-based publicly verifiable secret sharing scheme, Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem, Strong \((n, t, n)\) verifiable secret sharing scheme, Efficient and Decentralized Polling Protocol for General Social Networks, Threshold changeable secret sharing with secure secret reconstruction, Secret sharing over infinite domains, Two-operation homomorphic perfect sharing schemes over rings, Secure Bayesian model averaging for horizontally partitioned data, On abelian and homomorphic secret sharing schemes, Threshold schemes from isogeny assumptions, Secure computation with horizontally partitioned data using adaptive regression splines, Practical Fault-Tolerant Data Aggregation, Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs, Ideal homomorphic secret sharing schemes over cyclic groups, Reversible data hiding based on Shamir's secret sharing for color images over cloud, Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation, Unnamed Item, The privacy of dense symmetric functions, An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials, General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting, Dynamic threshold secret reconstruction and its application to the threshold cryptography, On the structure of the privacy hierarchy
