Abstract A (t, n) secret sharing scheme permits a secret to be divided into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. Verifiable secret sharing (VSS) has been proposed to allow each shareholder to verify the validity of his own share, but not other shareholders' shares. In this paper, we propose an ...

We improve certain degree bounds for Gröbner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable position or quasi stable position. Furthermore, we exhibit new dimension(and depth-)dependent upper bounds for the Castelnuovo-Mumford regularity and the degrees ...

In this paper, we first propose a protocol in which the prover can show that a = b holds for two committed integers a and b; also, we present a protocol in which the prover can prove that a 6= 0 holds for committed integer a; then, we construct a protocol to prove that the degree of a polynomial f(x) equals to t− 1 exactly, which has been as an open problem(see[21]); finally, we provide a proto...

This paper presents a non-interactive verifiable secret sharing scheme (VSS) tolerating a dishonest majority based on data predistributed by a trusted authority. As an application of this VSS scheme we present very efficient unconditionally secure multiparty protocols based on pre-distributed data which generalize two-party computations based on linear pre-distributed bit commitments. The main ...

Working at system level is attracting increasing interest, as it supports the exploration of several alternatives, before the hardware/software partitioning takes place. New issues must be taken into account, such as validation and verification at all steps. Within the framework of a system-level design methodology that supports verification, communication protocols among processes play a key r...

This paper presents a case study in modeling and verifying a POSIX-like file store for Flash memory. This work fits in the context of Hoare’s verification challenge and, in particular, Joshi and Holzmann’s mini-challenge to build a verifiable file store. We have designed a simple robust file store and implemented it in the form of a Promela model. A test harness is used to exercise the file sto...

Declarative specifications of digital systems often contain parts that can be automatically translated into executable code. Automated code generation, as opposed to manual code writing, eliminates a potential source of errors when a prototype implementation of these models is required. Furthermore, code generation allows for better integration of formal methods into the software development pr...

Attribute-based encryption (ABE) with outsourced decryption not only enables finegrained sharing of encrypted data, but also overcomes the effective drawback of the standard ABE schemes. An Attribute based encryption scheme with outsourced decryption allows a third party (e.g., a cloud server) to renovate an ABE cipher text into a (short) El Gamal-type cipher text using a public transformation ...