scientific article; zbMATH DE number 1942426
From MaRDI portal
Publication:4409124
zbMATH Open1026.94546MaRDI QIDQ4409124FDOQ4409124
Authors: Ronald Cramer, Serge Fehr 
Publication date: 30 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2442/24420272.htm
Title of this publication is not available (Why is that?)
Recommendations
- Publicly verifiable secret sharing using non-abelian groups
- A verifiable secret sharing scheme using non-abelian groups
- On Secure Multi-party Computation in Black-Box Groups
- scientific article; zbMATH DE number 826068
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
- On abelian and homomorphic secret sharing schemes
- Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
- On group-characterizability of homomorphic secret sharing schemes
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Secret sharing using non-commutative groups and the shortlex order
Cryptography (94A60) Algebraic numbers; rings of algebraic integers (11R04) Authentication, digital signatures and secret sharing (94A62) Finite abelian groups (20K01)
Cited In (18)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Efficient integer span program for hierarchical threshold access structure
- On the communication required for unconditionally secure multiplication
- On group-characterizability of homomorphic secret sharing schemes
- Adaptively secure distributed PRFs from LWE
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
- Title not available (Why is that?)
- On ideal homomorphic secret sharing schemes and their decomposition
- Threshold secret sharing requires a linear-size alphabet
- How to recover a secret with \(O(n)\) additions
- Secure multiparty computation from threshold encryption based on class groups
- On abelian and homomorphic secret sharing schemes
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- On sigma-protocols and (packed) black-box secret sharing schemes
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Evolving perfect hash families: a combinatorial viewpoint of evolving secret sharing
- Efficient robust secret sharing from expander graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409124)
