Searcharxiv⌕ Search

arXiv subjects

Yi Deng

Publications and source records attributed to Yi Deng.

21 records · Page 2Linked to original sources

Direct measurement of cell wall stress-stiffening and turgor pressure in live bacterial cells

We study intact and bulging Escherichia coli cells using atomic force microscopy to separate the contributions of the cell wall and turgor pressure to the overall cell stiffness. We find strong evidence of power-law stress-stiffening in the E. coli cell wall, with an exponent of 1.22 \pm 0.12, such that the wall is significantly stiffer in intact cells (E = 23 \pm 8 MPa and 49 \pm 20 MPa in the axial and circumferential directions) than in unpressurized sacculi. These measurements also indicate that the turgor pressure in living cells E. coli is 29 \pm 3 kPa.

physics.bio-ph↗

Concurrently Non-Malleable Zero Knowledge in the Authenticated Public-Key Model

We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zero-knowledge arguments of knowledge that remain secure against concurrent man-in-the-middle attacks. In an effort to reduce the setup assumptions required for efficient zero-knowledge arguments of knowledge that remain secure against concurrent man-in-the-middle attacks, we consider a model, which we call the Authenticated Public-Key (APK) model. The APK model seems to significantly reduce the setup assumptions made by the CRS model (as no trusted party or honest execution of a centralized algorithm are required), and can be seen as a slightly stronger variation of the Bare Public-Key (BPK) model from \cite{CGGM,MR}, and a weaker variation of the registered public-key model used in \cite{BCNP}. We then define and study man-in-the-middle attacks in the APK model. Our main result is a constant-round concurrent non-malleable zero-knowledge argument of knowledge for any polynomial-time relation (associated to a language in $\mathcal{NP}$), under the (minimal) assumption of the existence of a one-way function family. Furthermore,We show time-efficient instantiations of our protocol based on known number-theoretic assumptions. We also note a negative result with respect to further reducing the setup assumptions of our protocol to those in the (unauthenticated) BPK model, by showing that concurrently non-malleable zero-knowledge arguments of knowledge in the BPK model are only possible for trivial languages.

cs.CR↗

Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption

In this paper we resolve an open problem regarding resettable zero knowledge in the bare public-key (BPK for short) model: Does there exist constant round resettable zero knowledge argument with concurrent soundness for $\mathcal{NP}$ in BPK model without assuming \emph{sub-exponential hardness}? We give a positive answer to this question by presenting such a protocol for any language in $\mathcal{NP}$ in the bare public-key model assuming only collision-resistant hash functions against \emph{polynomial-time} adversaries.

cs.CR↗