Distributing the Encryption and Decryption of a Block Cipher

In threshold cryptography, the goal is to distribute the computation of basic cryptographic primitives across a number of nodes in order to relax trust assumptions on individual nodes, as well as to introduce a level of fault-tolerance against node compromise. Most threshold cryptography has previously looked at the distribution of public key primitives, particularly threshold signatures and threshold decryption mechanisms. In this paper, we look at the application of threshold cryptography to symmetric primitives, and in particular the encryption or decryption of a symmetric key block cipher. We comment on some previous work in this area and then propose a model for shared encryption / decryption of a block cipher. We will present several approaches to enable such systems and will compare them.AMS classification: 94A60, 94A62, 68P25     

手机广告链中移动运营商的努力动机研究与仿真

建立了由单手机广告主、手机广告代理商和移动运营商构成的三级广告产业链之间的基于协作的收益共享契约模型,分析了在以移动运营商为主导的手机广告链中,移动运营商的努力动机受收益共享和努力成本补偿参数的影响.采用量化分析和模拟仿真结合的方法,得出契约参数只有在满足一定条件下,移动运营商所做出的最优努力水平投入决策,将使得整个手机产业链收益最大化,实现多方共赢.     

A finite differences MATLAB code for the numerical solution of second order singular perturbation problems

We show the main features of the MATLAB code HOFiD_UP for solving second order singular perturbation problems. The code is based on high order finite differences, in particular on the generalized upwind method. Within its simplicity, it uses order variation and continuation for solving any difficult nonlinear scalar problem. Several numerical tests on linear and nonlinear problems are considered. The best performances are reported on problems with perturbation parameters near the machine precision, where most of the codes for two-point BVPs fail.     

A general mixed covolume framework for constructing conservative schemes for elliptic problems

We present a general framework for the finite volume or covolume schemes developed for second order elliptic problems in mixed form, i.e., written as first order systems. We connect these schemes to standard mixed finite element methods via a one-to-one transfer operator between trial and test spaces. In the nonsymmetric case (convection-diffusion equation) we show one-half order convergence rate for the flux variable which is approximated either by the lowest order Raviart-Thomas space or by its image in the space of discontinuous piecewise constants. In the symmetric case (diffusion equation) a first order convergence rate is obtained for both the state variable (e.g., concentration) and its flux. Numerical experiments are included.

     

The Quantum Cohomology Ring of Flag Varieties

We describe the small quantum cohomology ring of complete flag varieties by algebro-geometric methods, as presented in our previous work Quantum cohomology of flag varieties (Internat. Math. Res. Notices, no. 6 (1995), 263-277). We also give a geometric proof of the quantum Monk formula.

     

A thermodynamic and dynamic subgrid closure model for two‐material cells

A general and robust subgrid closure model for two‐material cells is proposed. The conservative quantities of the entire cell are apportioned between two materials, and then, pressure and velocity are fully or partially equilibrated by modeling subgrid wave interactions. An unconditionally stable and entropy‐satisfying solution of the processes has been successfully found. The solution is valid for arbitrary level of relaxation. The model is numerically designed with care for general materials and is computationally efficient without recourse to subgrid iterations or subcycling in time. The model is implemented and tested in the Lagrange‐remap framework. Two interesting results are observed in 1D tests. First, on the basis of the closure model without any pressure and velocity relaxation, a material interface can be resolved without creating numerical oscillations and/or large nonphysical jumps in the problem of the modified Sod shock tube. Second, the overheating problem seen near the wall surface can be solved by the present entropy‐satisfying closure model. The generality, robustness, and efficiency of the model make it useful in principle in algorithms, such as ALE methods, volume of fluid methods, and even some mixture models, for compressible two‐phase flow computations. Copyright © 2013 John Wiley & Sons, Ltd.     

On the Accuracy of Upwind and Symmetric TVD Schemes in Simulating Low Mach Number Flow

The accuracy of MUSCL upwind and Yee-Roe-Davis symmetric TVD schemes for simulating low Mach number flow is studied through a numerical experiment of the 2-D lid driven cavity problem. The steady slate solution is reached by using a marching approach based on the pseudocompressibilty method in conjunction with implicit approximate factorization. A finite volume discretization of the conservation equations is used with a four level multigrid method to accelerate the convergence. The tests performed which were in the range of 100 ≤ Re ≤ 5000, show that the Yee-Roe-Davis symmetric scheme generates results in very good agreement with the benchmark results over this range of Re. The MUSCL upwind scheme accuracy deteriorates with the increasing Re.     

A Cure for the Sonic Point Glitch

Among the various numerical schemes developed since the ’80s for the computation of the compressible Euler equations, the vast majority produce in certain cases spurious pressure glitches at sonic points. This flaw is particularly visible in the computation of transonic expansions and leads lo unphysical “expansion shocks” when the flow undergoes rapid change of direction.

The analysis of this flaw is presented, based on a series of numerical experiments. For Flux-Vector Splitting methods, it is suggested that it is not the order of differentiability of the numerical flux which is crucial but the way the pressure at an interface is calculated. A new way of evaluating the pressure at the interface is proposed, based upon kinetic theory, and is applied to most current available algorithms including Flux-Vector Splitting and Flux-Difference Splitting methods as well as recent hybrid schemes (AUSM, HUS).     

Review of Computational Aeroacoustics Algorithms

This paper presents a review of recent advancements in computational methodology for aeroacoustics problems. High-order finite difference methods for computation of linear and nonlinear acoustic waves are the primary focus of the review. Schemes for numerical simulation of linear waves include explicit optimized and DRP finite-difference operators, compact schemes, wavenumber extended upwind schemes and leapfrog-like algorithms. Both spatial approximations and time-integration techniques, which include low-dissipation low-dispersion Adams-Bashforth and Runge-Kutta (RK) methods, are examined. Wave propagation properties are analysed in the wavenumber and frequency space. Different approaches to eliminate short-wave spurious numerical waves are also reviewed. Methods for simulating nonlinear acoustic phenomena include essentially non-oscillatory (ENO) schemes, numerical adaptive filtering for high-order explicit and compact finite-difference operators, MacCormack and adaptive compact nonlinear algorithms. A literature survey of other CAA methods is provided in the introductory part.     

Comparison of implicit and explicit AUSM‐family schemes for compressible multiphase flows

This paper makes the first attempt of extending implicit AUSM‐family schemes to multiphase flow simulations. Water faucet, air–water shock tube and oscillating manometer problems are used as benchmark tests with the generic four‐equation two‐fluid model. For solving the equations implicitly, Newton's method along with a sparse matrix solver (UMFPACK solver) is employed, and the numerical Jacobian matrix is calculated. Comparison between implicit and explicit AUSM‐family schemes is presented, indicating that similarly accurate results are obtained with both schemes. Furthermore, the water faucet problem is solved using both staggered and collocated grids. This investigation helps integrate high‐resolution schemes into staggered‐grid‐based computational algorithms. The influence of the interface pressure correction on the simulation results is also examined. Results show that the interfacial pressure correction introduces numerical dissipation. However, this dissipation cannot eliminate the overshoots because of the incompatibility of numerical discretization of the conservative and non‐conservative terms in the governing equations. The comparison of CPU time between implicit and explicit schemes is also studied, indicating that the implicit scheme is capable of improving the computational efficiency over its explicit counterpart. Copyright © 2014 John Wiley & Sons, Ltd.