Round-Optimal and Efficient Verifiable Secret Sharing

Lecture Notes in Computer Science- Germany

doi 10.1007/11681878_17

Full Text

Abstract

Available in

Categories

Computer Science

Theoretical Computer Science

Date

January 1, 2006

Authors

Shyamnath Gollakota

C. Pandu Rangan

Kannan Srinathan

Publisher

Springer Berlin Heidelberg

Related search

Verifiable Essential Secret Image Sharing With Multiple Decryptions

International Journal of Recent Technology and Engineering

Management of Technology

English

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

Algebraic Structures and their Applications

Applied Mathematics

English

A (N,t,n) Verifiable Multi-Secret Sharing Scheme With Secure Secret Reconstruction

International Journal of Security and its Applications

Computer Science

English

A Novel Verifiable Secret Sharing With Detection and Identification of Cheaters' Group

International Journal of Mathematical Sciences and Computing

English

A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting

Lecture Notes in Computer Science

Computer Science

Theoretical Computer Science

English

Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Electronic Engineering

Computer Graphics

Signal Processing

Applied Mathematics

Computer-Aided Design

English

Efficient Secret Sharing Schemes From Room Square

English

New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications

Lecture Notes in Computer Science

Computer Science

Theoretical Computer Science

English

Efficient Multi Secret Sharing With Generalized Access Structures

International Journal of Computer Applications

English