Volterra-Prabhakar derivative of distributed order and some applications

The paper studies the exact solution of two kinds of generalized Fokker-Planck equations in which the integral kernels are given either by the distributed order function $k_{1}(t) = \int_{0}^{1} t^{-\mu}/\Gamma(1- \mu) d\mu$ or the distributed order Prabhakar function $k_{2}(\alpha, \gamma; \lambda; t) = \int_{0}^{1} e^{-\gamma}_{\alpha, 1 - \mu}(\lambda; t) d\mu$, where the Prabhakar function is denoted as $e^{-\gamma}_{\alpha, 1 - \mu}(\lambda; t)$. Both of these integral kernels can be called the fading memory functions and are the Stieltjes functions. It is also shown that their Stieltjes character is enough to ensure the non-negativity of the mean square values and higher even moments. The odd moments vanish. Thus, the solution of generalized Fokker-Planck equations can be called the probability density functions. We introduce also the Volterra-Prabhakar function and its generalization which are involved in the definition of $k_{2}(\alpha, \gamma; \lambda; t)$ and generated by it the probability density function $p_2(x, t)$

Predictable arguments of knowledge

We initiate a formal investigation on the power of predictability for argument of knowledge systems for NP. Specifically, we consider private-coin argument systems where the answer of the prover can be predicted, given the private randomness of the verifier; we call such protocols Predictable Arguments of Knowledge (PAoK). Our study encompasses a full characterization of PAoK, showing that such arguments can be made extremely laconic, with the prover sending a single bit, and assumed to have only one round (i.e., two messages) of communication without loss of generality. We additionally explore PAoK satisfying additional properties (including zero-knowledge and the possibility of re-using the same challenge across multiple executions with the prover), present several constructions of PAoK relying on different cryptographic tools, and discuss applications to cryptography

Properties of LiMnBO3 glasses and nanostructured glass-ceramics

Polycrystalline LiMnBO3 is a promising cathode material for Li-ion batteries. In this work, we investigated the thermal, structural and electrical properties of glassy and nanocrystallized materials having the same chemical composition. The original glass was obtained via a standard meltquenching method. SEM and 7Li solid-state NMR indicate that it contains a mixture of two distinct glassy phases. The results suggest that the electrical conductivity of the glass is dominated by the ionic one. The dc conductivity of initial glass was estimated to be in the order of 10-18 S.cm-1 at room temperature. The thermal nanocrystallization of the glass produces a nanostructured glass-ceramics containing MnBO3 and LiMnBO3 phases. The electric conductivity of this glass-ceramics is increased by 6 orders of magnitude, compared to the starting material at room temperature. Compared to other manganese and borate containing glasses reported in the literature, the conductivity of the nanostructured glass ceramics is higher than that of the previously reported glassy materials. Such improved conductivity stems from the facilitated electronic transport along the grain boundaries

LNCS

This paper studies the concrete security of PRFs and MACs obtained by keying hash functions based on the sponge paradigm. One such hash function is KECCAK, selected as NIST’s new SHA-3 standard. In contrast to other approaches like HMAC, the exact security of keyed sponges is not well understood. Indeed, recent security analyses delivered concrete security bounds which are far from existing attacks. This paper aims to close this gap. We prove (nearly) exact bounds on the concrete PRF security of keyed sponges using a random permutation. These bounds are tight for the most relevant ranges of parameters, i.e., for messages of length (roughly) l ≤ min{2n/4, 2r} blocks, where n is the state size and r is the desired output length; and for l ≤ q queries (to the construction or the underlying permutation). Moreover, we also improve standard-model bounds. As an intermediate step of independent interest, we prove tight bounds on the PRF security of the truncated CBC-MAC construction, which operates as plain CBC-MAC, but only returns a prefix of the output

Tracing a phase transition with fluctuations of the largest fragment size: Statistical multifragmentation models and the ALADIN S254 data

A phase transition signature associated with cumulants of the largest fragment size distribution has been identified in statistical multifragmentation models and examined in analysis of the ALADIN S254 data on fragmentation of neutron-poor and neutron-rich projectiles. Characteristics of the transition point indicated by this signature are weakly dependent on the A/Z ratio of the fragmenting spectator source. In particular, chemical freeze-out temperatures are estimated within the range 5.9 to 6.5 MeV. The experimental results are well reproduced by the SMM model.Comment: 7 pages, 3 figures, Proceedings of the International Workshop on Multifragmentation and Related Topics (IWM2009), Catania, Italy, November 2009

A MAC Mode for Lightweight Block Ciphers

status: accepte

Development of a Simple Mechanical Screening Method for Predicting the Feedability of a Pharmaceutical FDM 3D Printing Filament

Purpose: The filament-based feeding mechanism employed by the majority of fused deposition modelling (FDM) 3D printers dictates that the materials must have very specific mechanical characteristics. Without a suitable mechanical profile, the filament can cause blockages in the printer. The purpose of this study was to develop a method to screen the mechanical properties of pharmaceutically-relevant, hot-melt extruded filaments to predetermine their suitability for FDM. Methods: A texture analyzer was used to simulate the forces a filament is subjected to inside the printer. The texture analyzer produced a force-distance curve referred to as the flexibility profile. Principal Component Analysis and Correlation Analysis statistical methods were then used to compare the flexibility profiles of commercial filaments to in-house made filaments. Results: Principal component analysis showed clearly separated clustering of filaments that suffer from mechanical defects versus filaments which are suitable for printing. Correlation scores likewise showed significantly greater values with feedable filaments than their mechanically deficient counterparts. Conclusion: The screening method developed in this study showed, with statistical significance and reproducibility, the ability to predetermine the feedability of extruded filaments into an FDM printer

Tropical biogeomorphic seagrass landscapes for coastal protection:Persistence and wave attenuation during major storms events

The intensity of major storm events generated within the Atlantic Basin is projected to rise with the warming of the oceans, which is likely to exacerbate coastal erosion. Nature-based flood defence has been proposed as a sustainable and effective solution to protect coastlines. However, the ability of natural ecosystems to withstand major storms like tropical hurricanes has yet to be thoroughly tested. Seagrass meadows both stabilise sediment and attenuate waves, providing effective coastal protection services for sandy beaches. To examine the tolerance of Caribbean seagrass meadows to extreme storm events, and to investigate the extent of protection they deliver to beaches, we employed a combination of field surveys, biomechanical measurements and wave modelling simulations. Field surveys of sea- grass meadows before and after a direct hit by the category 5 Hurricane Irma documented that estab- lished seagrass meadows of Thalassia testudinum re- mained unaltered after the extreme storm event. The flexible leaves and thalli of seagrass and calci- fying macroalgae inhabiting the meadows were shown to sustain the wave forces that they are likely to experience during hurricanes. In addition, the seagrass canopy and the complex biogeomorphic landscape built by the seagrass meadows combine to significantly dissipate extreme wave forces, ensuring that erosion is minimised within sandy beach fore- shores. The persistence of the Caribbean seagrass meadows and their coastal protection services dur- ing extreme storm events ensures that a stable coastal ecosystem and beach foreshore is maintained in tropical regions

A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence

Hardness amplification is a central problem in the study of interactive protocols. While natural parallel repetition transformation is known to reduce the soundness error of some special cases of interactive arguments: three-message protocols (Bellare, Impagliazzo, and Naor [FOCS \u2797]) and public-coin protocols (Hastad, Pass, Wikstrom, and Pietrzak [TCC \u2710], Chung and Lu [TCC \u2710] and Chung and Pass [TCC \u2715]), it fails to do so in the general case (the above Bellare et al.; also Pietrzak and Wikstrom [TCC \u2707]). The only known round-preserving approach that applies to all interactive arguments is Haitner\u27s random-terminating transformation [SICOMP \u2713], who showed that the parallel repetition of the transformed protocol reduces the soundness error at a weak exponential rate: if the original $m$-round protocol has soundness error $1-\varepsilon$, then the $n$-parallel repetition of its random-terminating variant has soundness error $(1-\varepsilon)^{\varepsilon n / m^4}$ (omitting constant factors). Hastad et al. have generalized this result to partially simulatable interactive arguments, showing that the $n$-fold repetition of an $m$-round $\delta$-simulatable argument of soundness error $1-\varepsilon$ has soundness error $(1-\varepsilon)^{\varepsilon \delta^2 n / m^2}$. When applied to random-terminating arguments, the Hastad et al. bound matches that of Haitner. In this work we prove that parallel repetition of random-terminating arguments reduces the soundness error at a much stronger exponential rate: the soundness error of the $n$ parallel repetition is $(1-\varepsilon)^{n / m}$, only an $m$ factor from the optimal rate of $(1-\varepsilon)^n$ achievable in public-coin and three-message arguments. The result generalizes to $\delta$-simulatable arguments, for which we prove a bound of $(1-\varepsilon)^{\delta n / m}$. This is achieved by presenting a tight bound on a relaxed variant of the KL-divergence between the distribution induced by our reduction and its ideal variant, a result whose scope extends beyond parallel repetition proofs. We prove the tightness of the above bound for random-terminating arguments, by presenting a matching protocol