How to share a function securely
From MaRDI portal
Publication:2817644
DOI10.1145/195058.195405zbMath1345.94094OpenAlexW2009432965MaRDI QIDQ2817644
Alfredo De Santis, Yair Frankel, Mordechai M. Yung, Yvo G. Desmedt
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195405
Related Items
Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency ⋮ Traceable secret sharing and applications ⋮ Cutting-edge cryptography through the lens of secret sharing ⋮ Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares ⋮ Robust and Efficient Sharing of RSA Functions ⋮ Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions ⋮ Threshold cryptography based on Asmuth-Bloom secret sharing ⋮ Adaptively secure threshold symmetric-key encryption ⋮ Dynamic Threshold Public-Key Encryption with Decryption Consistency from Static Assumptions ⋮ On characterizations of escrow encryption schemes ⋮ Optimal resilient threshold GQ signatures ⋮ Threshold and multi-signature schemes from linear hash functions ⋮ Short leakage resilient and non-malleable secret sharing schemes ⋮ Robust Threshold Schemes Based on the Chinese Remainder Theorem ⋮ Efficient dynamic threshold identity-based encryption with constant-size ciphertext ⋮ Better than advertised security for non-interactive threshold signatures ⋮ New bounds on the local leakage resilience of Shamir's secret sharing scheme ⋮ Practical Schnorr threshold signatures without the algebraic group model ⋮ Privacy-preserving outsourcing of image feature extraction in cloud computing ⋮ Efficient identity-based threshold decryption scheme from bilinear pairings ⋮ Distributed Pseudorandom Functions for General Access Structures in NP ⋮ Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Efficient certificateless threshold signatures without random oracles ⋮ Simplified Threshold RSA with Adaptive and Proactive Security ⋮ Cutting-Edge Cryptography Through the Lens of Secret Sharing ⋮ Threshold RSA for Dynamic and Ad-Hoc Groups ⋮ Provably Secure Threshold Paillier Encryption Based on Hyperplane Geometry ⋮ Fair Threshold Decryption with Semi-Trusted Third Parties ⋮ Aggregatable distributed key generation ⋮ Practical Threshold Signatures with Linear Secret Sharing Schemes ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Shared generation of pseudo-random functions ⋮ Secure distributed storage and retrieval ⋮ New efficient and secure protocols for verifiable signature sharing and other applications ⋮ Distributing the encryption and decryption of a block cipher ⋮ Adaptively secure distributed public-key systems. ⋮ Robust threshold DSS signatures ⋮ Efficient and Adaptive Threshold Signatures for Ad hoc networks ⋮ Nearly optimal robust secret sharing against rushing adversaries ⋮ Sharing DSS by the Chinese remainder theorem ⋮ Dynamic threshold secret reconstruction and its application to the threshold cryptography
This page was built for publication: How to share a function securely
