On the relations between non-interactive key distribution,identity-based encryption and trapdoor discrete log groups

This paper investigates the relationships between identity-based non-interactive key distribution (ID-NIKD) and identity-based encryption (IBE). It provides a new security model for ID-NIKD, and a construction that converts a secure ID-NIKD scheme satisfying certain conditions into a secure IBE scheme. This conversion is used to explain the relationship between the ID-NIKD scheme of Sakai, Ohgishi and Kasahara and the IBE scheme of Boneh and Franklin. The paper then explores the construction of ID-NIKD and IBE schemes from general trapdoor discrete log groups. Two different concrete instantiations for such groups provide new, provably secure ID-NIKD and IBE schemes. These schemes are suited to applications in which the Trusted Authority is computationally well-resourced, but clients performing encryption/decryption are highly constrained.      

A Linear Algebraic Approach to Metering Schemes

A metering scheme is a method by which an audit agency is able to measure the interaction between servers and clients during a certain number of time frames. Naor and Pinkas (Vol. 1403 of LNCS, pp. 576–590) proposed metering schemes where any server is able to compute a proof (i.e., a value to be shown to the audit agency at the end of each time frame), if and only if it has been visited by a number of clients larger than or equal to some threshold h during the time frame. Masucci and Stinson (Vol. 1895 of LNCS, pp. 72–87) showed how to construct a metering scheme realizing any access structure, where the access structure is the family of all subsets of clients which enable a server to compute its proof. They also provided lower bounds on the communication complexity of metering schemes. In this paper we describe a linear algebraic approach to design metering schemes realizing any access structure. Namely, given any access structure, we present a method to construct a metering scheme realizing it from any linear secret sharing scheme with the same access structure. Besides, we prove some properties about the relationship between metering schemes and secret sharing schemes. These properties provide some new bounds on the information distributed to clients and servers in a metering scheme. According to these bounds, the optimality of the metering schemes obtained by our method relies upon the optimality of the linear secret sharing schemes for the given access structure.     

Full rank interpolatory subdivision: A first encounter with the multivariate realm

We extend our previous work on interpolatory vector subdivision schemes to the multivariate case. As in the univariate case we show that the diagonal and off-diagonal elements of such a scheme have a significantly different structure and that under certain circumstances symmetry of the mask can increase the polynomial reproduction power of the subdivision scheme. Moreover, we briefly point out how tensor product constructions for vector subdivision schemes can be obtained.     

Symbolic computation of high order compact difference schemes for three dimensional linear elliptic partial differential equations with variable coefficients

We present a symbolic computation procedure for deriving various high order compact difference approximation schemes for certain three dimensional linear elliptic partial differential equations with variable coefficients. Based on the Maple software package, we approximate the leading terms in the truncation error of the Taylor series expansion of the governing equation and obtain a 19 point fourth order compact difference scheme for a general linear elliptic partial differential equation. A test problem is solved numerically to validate the derived fourth order compact difference scheme. This symbolic derivation method is simple and can be easily used to derive high order difference approximation schemes for other similar linear elliptic partial differential equations.     

Unconditional stability of parallel alternating difference schemes for semilinear parabolic systems

The general alternating schemes with intrinsic parallelism for semilinear parabolic systems are studied. First we prove the a priori estimates in the discrete H¹ space of the difference solution for these schemes. Then the existence of the difference solution for these schemes follows from the fixed point principle. Finally the unconditional stability of the general alternating schemes is proved. The alternating group explicit scheme, the alternating segment explicit–implicit scheme and the alternating segment Crank–Nicolson scheme are the special cases of the general alternating schemes.     

A framework for obtaining guaranteed error bounds for finite element approximations

We give an overview of our recent progress in developing a framework for the derivation of fully computable guaranteed posteriori error bounds for finite element approximation including conforming, non-conforming, mixed and discontinuous finite element schemes. Whilst the details of the actual estimator are rather different for each particular scheme, there is nonetheless a common underlying structure at work in all cases. We aim to illustrate this structure by treating conforming, non-conforming and discontinuous finite element schemes in a single framework. In taking a rather general viewpoint, some of the finer details of the analysis that rely on the specific properties of each particular scheme are obscured but, in return, we hope to allow the reader to ‘see the wood despite the trees’.     

Smoothness Analysis of Subdivision Schemes by Proximity

Linear curve subdivision schemes may be perturbed in various ways, for example, by modifying them such as to work in a manifold, surface, or group. The analysis of such perturbed and often nonlinear schemes "T" is based on their proximity to the linear schemes "S" which they are derived from. This paper considers two aspects of this problem: One is to find proximity inequalities which together with C^k smoothness of S imply C^k smoothness of T. The other is to verify these proximity inequalities for several ways to construct the nonlinear scheme T analogous to the linear scheme S. The first question is treated for general k, whereas the second one is treated only in the case k = 2. The main result of the paper is that convergent geodesic/projection/Lie group analogues of a certain class of factorizable linear schemes have C² limit curves.     

A Vertex-Centered and Positivity-Preserving Finite Volume Scheme for Two-Dimensional Three-Temperature Radiation Diffusion Equations on General Polygonal Meshes

Two-dimensional three-temperature (2-D 3-T) radiation diffusion equations are widely used to approximately describe the evolution of radiation energy within a multimaterial system and explain the exchange of energy among electrons, ions and photons. In this paper, we suggest a new positivity-preserving finite volume scheme for 2-D 3-T radiation diffusion equations on general polygonal meshes. The vertex unknowns are treated as primary ones for which the finite volume equations are constructed. The edge-midpoint and cell-centered unknowns are used as auxiliary ones and interpolated by the primary unknowns, which makes the final scheme a pure vertex-centered one. By comparison, most existing positivity-preserving finite volume schemes are cell-centered and based on the convex decomposition of the co-normal. Here, the co-normal decomposition is not convex in general, leading to a fixed stencil of the flux approximation and avoiding a certain search algorithm on complex grids. Moreover, the new scheme effectively alleviates the numerical heat-barrier issue suffered by most existing cell-centered or hybrid schemes in solving strongly nonlinear radiation diffusion equations. Numerical experiments demonstrate the second-order accuracy and the positivity of the solution on various distorted grids. For the problem without analytic solution, the contours of the numerical solutions obtained by our scheme on distorted meshes accord with those on smooth quadrilateral meshes.     

Investigations of nonstandard,Mickens‐type,finite‐difference schemes for singular boundary value problems in cylindrical or spherical coordinates

It is well known that standard finite‐difference schemes for singular boundary value problems involving the Laplacian have difficulty capturing the singular (??(1/r) or ??(log r)) behavior of the solution near the origin (r = 0). New nonstandard finite‐difference schemes that can capture this behavior exactly for certain singular boundary value problems encountered in theoretical aerodynamics are presented here. These schemes are special cases of nonstandard finite differences which have been extensively researched by Professor Ronald E. Mickens of Clark Atlanta University in their most general form. Several examples of these “Mickens‐type” finite differences that illustrate both their accuracy and utility for singular boundary value problems in both cylindrical and spherical co‐ordinates are investigated. The numerical results generated by the Mickens‐type schemes are compared favorably with solutions obtained from standard finite‐difference schemes. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 380–398, 2003.     

Secret sharing schemes with partial broadcast channels

In a conventional secret sharing scheme a dealer uses secure point-to-point channels to distribute the shares of a secret to a number of participants. At a later stage an authorised group of participants send their shares through secure point-to-point channels to a combiner who will reconstruct the secret. In this paper, we assume no point-to-point channel exists and communication is only through partial broadcast channels. A partial broadcast channel is a point-to-multipoint channel that enables a sender to send the same message simultaneously and privately to a fixed subset of receivers. We study secret sharing schemes with partial broadcast channels, called partial broadcast secret sharing schemes. We show that a necessary and sufficient condition for the partial broadcast channel allocation of a (t, n)-threshold partial secret sharing scheme is equivalent to a combinatorial object called a cover-free family. We use this property to construct a (t, n)-threshold partial broadcast secret sharing scheme with O(log n) partial broadcast channels. This is a significant reduction compared to n point-to-point channels required in a conventional secret sharing scheme. Next, we consider communication rate of a partial broadcast secret sharing scheme defined as the ratio of the secret size to the total size of messages sent by the dealer. We show that the communication rate of a partial broadcast secret sharing scheme can approach 1/O(log n) which is a significant increase over the corresponding value, 1/n, in the conventional secret sharing schemes. We derive a lower bound on the communication rate and show that for a (t,n)-threshold partial broadcast secret sharing scheme the rate is at least 1/t and then we propose constructions with high communication rates. We also present the case of partial broadcast secret sharing schemes for general access structures, discuss possible extensions of this work and propose a number of open problems.      

A note on log etale Čech cohomolog

In this paper, we prove the comparison theorem between log etale cohomology and log etale Čech cohomology for certain log schemes, which is a generalization of a result of Artin on the comparison theorem between etale cohomology and etale Čech cohomology. It turns out that the naive generalization is not true, and we also give a counter-example for it. Received: 2 July 2000 / Revised version: 4 September 2000     

Indexed algebras associated to a log structure and a theorem of p-descent on log schemes

After discussing gradings by sheaves of degrees, we associate to any log scheme a canonical invertible sheaf endowed with a certain multiplicative structure, which we call its associated graded algebra. In the relative case we construct a canonical connection on this algebra. In the log smooth case over a base of positive characteristic p, we study integrable and p-integrable graded modules over this algebra, and establish a Cartier type p-descent theorem, generalizing previous results of Ogus. We apply it to give an alternate proof of a result of Tsuji on closed forms fixed by the Cartier operator Received: 15 January 1999 / Revised version: 30 September 1999     

Association schemes and hypergroups

In this paper, we investigate hypergroups which arise from association schemes in a canonical way; this class of hypergroups is called realizable. We first study basic algebraic properties of realizable hypergroups. Then we prove that two interesting classes of hypergroups (partition hypergroups and linearly ordered hypergroups) are realizable. Along the way, we prove that a certain class of projective geometries is equipped with a canonical association scheme structure which allows us to link three objects; association schemes, hypergroups, and projective geometries (see, Section 1.2 for details).     

General regularization schemes for signal detection in inverse problems

The authors discuss how general regularization schemes, in particular, linear regularization schemes and projection schemes, can be used to design tests for signal detection in statistical inverse problems. It is shown that such tests can attain the minimax separation rates when the regularization parameter is chosen appropriately. It is also shown how to modify these tests in order to obtain a test which adapts (up to a log log factor) to the unknown smoothness in the alternative. Moreover, the authors discuss how the so-called direct and indirect tests are related in terms of interpolation properties.     

On log local Cartier transform of higher level in characteristic <Emphasis Type="Italic">p</Emphasis>

In a previous paper, given an integral log smooth morphism \(X\rightarrow S\) of fine log schemes of characteristic \(p>0\), we studied the Azumaya nature of the sheaf of log differential operators of higher level and constructed a splitting module of it under the existence of a certain lifting modulo \(p^{2}\). In this paper, under a stronger liftability assumption, we construct another splitting module of our Azumaya algebra over a smaller scalar extension. As an application, we construct an equivalence, which we call the log local Cartier transform of higher level, between certain \(\mathcal {D}\)-modules and certain Higgs modules. We also discuss the compatibility of the log Frobenius descent and the log local Cartier transform and the relation between the splitting module constructed in this paper and that constructed in the previous paper. Our result can be considered as a generalization of the results of Ogus and Vologodsky, Gros, Le Stum and Quirós to the case of log schemes and that of Schepler to the case of higher level.     

ID-based cryptography using symmetric primitives

A general method for deriving an identity-based public key cryptosystem from a one-way function is described. We construct both ID-based signature schemes and ID-based encryption schemes. We use a general technique which is applied to multi-signature versions of the one-time signature scheme of Lamport and to a public key encryption scheme based on a symmetric block cipher which we present. We make use of one-way functions and block designs with properties related to cover-free families to optimise the efficiency of our schemes.      

Nonlinear Implicit One-Step Schemes for Solving Initial Value Problems for Ordinary Differential Equation with Steep Gradients

A general theory for nonlinear implicit one-step schemes for solving initial value problems for ordinary differential equations is presented in this paper. The general expansion of "symmetric" implicit one-step schemes having second-order is derived and stability and convergence are studied. As examples, some geometric schemes are given. Based on previous work of the first author on a generalization of means, a fourth-order nonlinear implicit one-step scheme is presented for solving equations with steep gradients. Also, a hybrid method based on the GMS and a fourth-order linear scheme is discussed. Some numerical results are given.     

Modified form of binary and ternary 3-point subdivision schemes

Binary 3-point scheme, developed by Hormann and Sabin [Hormann, K. and Sabin, Malcolm A., 2008, A family of subdivision schemes with cubic precision, Computer Aided Geometric Design, 25, 41-52], has been modified by introducing a tension parameter which generates a family of C¹ limiting curves for certain range of tension parameter. Ternary 3-point scheme, introduced by Siddiqi and Rehan [Siddiqi, Shahid S. and Rehan, K., 2009, A ternary three point scheme for curve designing, International Journal of Computer Mathematics, In Press, DOI: 10.1080/00207160802428220], has also been modified by introducing a tension parameter which generates family of C¹ and C² limiting curves for certain range of tension parameter. Laurent polynomial method is used to investigate the continuity of the subdivision schemes. The performance of modified schemes has been demonstrated by considering different examples along with its comparison with the established subdivision schemes.     

Construction of Canonical Difference Schemes for Hamiltonian Formalism via Generating Functions

This paper discusses the relationship between canonical maps and generating functions and gives the general Hamilton-Jacobi theory for time-independent Hamiltonian systems. Based on this theory, the general method — the generating function method — of the construction of difference schemes for Hamiltonian systems is considered. The transition of such difference schemes from one time-step to the next is canonical. So they are called the canonical difference schemes. The well known Euler centered scheme is a canonical difference scheme. Its higher order canonical generalisations and other families of canonical difference schemes are given. The construction method proposed in the paper is also applicable to time-dependent Hamiltonian systems.