12,202 research outputs found
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
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 in the bare public-key model assuming only
collision-resistant hash functions against \emph{polynomial-time} adversaries.Comment: 19 pag
Safe Neighborhood Computation for Hybrid System Verification
For the design and implementation of engineering systems, performing
model-based analysis can disclose potential safety issues at an early stage.
The analysis of hybrid system models is in general difficult due to the
intrinsic complexity of hybrid dynamics. In this paper, a simulation-based
approach to formal verification of hybrid systems is presented.Comment: In Proceedings HAS 2014, arXiv:1501.0540
- …