Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-89255-7_2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Efficient Multiplicative Sharing Schemes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

A Forward-Secure Threshold Signature Scheme Based on Multiplicative Secret Sharing and Strong RSA Assumption

DEStech Transactions on Computer Science and Engineering
2018English

Inequalities Characterizing Linear-Multiplicative Functionals

Journal of Function Spaces
Analysis
2015English

Function Theory and Multiplicative Linear Functionals

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1965English

Linear Correlations of Multiplicative Functions

Proceedings of the London Mathematical Society
Mathematics
2020English

Multiplicative Perturbations of Linear Volterra Equations

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1993English

Secret Sharing and Visual Cryptography Schemes

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2001English

Universally Ideal Secret-Sharing Schemes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1994English

On Multiplicative Linear Logic, Modality and Quantum Circuits

Electronic Proceedings in Theoretical Computer Science, EPTCS
Software
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy