The following pages link to How to share a function securely (Q2817644):
Displaying 40 items.
- Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency (Q278732) (← links)
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares (Q306248) (← links)
- Efficient certificateless threshold signatures without random oracles (Q545431) (← links)
- Optimal resilient threshold GQ signatures (Q881852) (← links)
- Efficient dynamic threshold identity-based encryption with constant-size ciphertext (Q897859) (← links)
- Secure distributed storage and retrieval (Q1575652) (← links)
- New efficient and secure protocols for verifiable signature sharing and other applications (Q1582011) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- Privacy-preserving outsourcing of image feature extraction in cloud computing (Q1701922) (← links)
- Efficient identity-based threshold decryption scheme from bilinear pairings (Q1712600) (← links)
- Shared generation of pseudo-random functions (Q1827581) (← links)
- Adaptively secure distributed public-key systems. (Q1853497) (← links)
- Robust threshold DSS signatures (Q1854399) (← links)
- Aggregatable distributed key generation (Q2056680) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- Nearly optimal robust secret sharing against rushing adversaries (Q2102061) (← links)
- Traceable secret sharing and applications (Q2129017) (← links)
- Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions (Q2149832) (← links)
- Adaptively secure threshold symmetric-key encryption (Q2152046) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Sharing DSS by the Chinese remainder theorem (Q2349622) (← links)
- Dynamic threshold secret reconstruction and its application to the threshold cryptography (Q2353654) (← links)
- Threshold cryptography based on Asmuth-Bloom secret sharing (Q2384533) (← links)
- Distributing the encryption and decryption of a block cipher (Q2572965) (← links)
- Cutting-Edge Cryptography Through the Lens of Secret Sharing (Q2799105) (← links)
- Provably Secure Threshold Paillier Encryption Based on Hyperplane Geometry (Q2817804) (← links)
- Efficient and Adaptive Threshold Signatures for Ad hoc networks (Q2864187) (← links)
- Dynamic Threshold Public-Key Encryption with Decryption Consistency from Static Assumptions (Q3194590) (← links)
- Distributed Pseudorandom Functions for General Access Structures in NP (Q3297480) (← links)
- Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing (Q3297627) (← links)
- Robust and Efficient Sharing of RSA Functions (Q3452349) (← links)
- Robust Threshold Schemes Based on the Chinese Remainder Theorem (Q3506373) (← links)
- Simplified Threshold RSA with Adaptive and Proactive Security (Q3593121) (← links)
- Fair Threshold Decryption with Semi-Trusted Third Parties (Q3634502) (← links)
- Practical Threshold Signatures with Linear Secret Sharing Schemes (Q3637139) (← links)
- On characterizations of escrow encryption schemes (Q4571999) (← links)
- Threshold RSA for Dynamic and Ad-Hoc Groups (Q5458587) (← links)
- Threshold structure-preserving signatures (Q6562572) (← links)
- Multi-recipient and threshold encryption based on hidden multipliers (Q6601464) (← links)
- Twinkle: threshold signatures from DDH with full adaptive security (Q6636400) (← links)
