A verifiable secret sharing scheme using non-abelian groups

In Delaram Kahrobaei, Bren Cavallo & David Garber (eds.), Algebra and computer science. Providence, Rhode Island: American Mathematical Society (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,757

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On secret sharing protocols.Chi Sing Chum [and 4 Others] - 2016 - In Delaram Kahrobaei, Bren Cavallo & David Garber (eds.), Algebra and computer science. Providence, Rhode Island: American Mathematical Society.
A new multi-server scheme for private information retrieval.Chi Sing Chum & Xiaowen Zhang - 2016 - In Delaram Kahrobaei, Bren Cavallo & David Garber (eds.), Algebra and computer science. Providence, Rhode Island: American Mathematical Society.
Geometry of the conjugacy problem in lamplighter groups.Andew Salle - 2016 - In Delaram Kahrobaei, Bren Cavallo & David Garber (eds.), Algebra and computer science. Providence, Rhode Island: American Mathematical Society.
Generic properties of subgroups of free groups and finite presentations.Frédérique Bassino, Cyril Nicaud & Pascal Weil - 2016 - In Delaram Kahrobaei, Bren Cavallo & David Garber (eds.), Algebra and computer science. Providence, Rhode Island: American Mathematical Society.
A Note on Bosbach’s Cone Algebras.Wolfgang Rump & Yichuan Yang - 2011 - Studia Logica 98 (3):375-386.
A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups.Armin Weiss - 2016 - In Delaram Kahrobaei, Bren Cavallo & David Garber (eds.), Algebra and computer science. Providence, Rhode Island: American Mathematical Society.
Axiomatization of abelian-by- G groups for a finite group G.Francis Oger - 2001 - Archive for Mathematical Logic 40 (7):515-521.
Knapsack and subset sum problems in nilpoint, polycyclic, and co-context-free groups.Daniel König, Markus Lohrey & George Zetzsche - 2016 - In Delaram Kahrobaei, Bren Cavallo & David Garber (eds.), Algebra and computer science. Providence, Rhode Island: American Mathematical Society.

Analytics

Added to PP
2022-12-13

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references