518 research outputs found
Concurrent Knowledge-Extraction in the Public-Key Model
Knowledge extraction is a fundamental notion, modelling machine possession of
values (witnesses) in a computational complexity sense. The notion provides an
essential tool for cryptographic protocol design and analysis, enabling one to
argue about the internal state of protocol players without ever looking at this
supposedly secret state. However, when transactions are concurrent (e.g., over
the Internet) with players possessing public-keys (as is common in
cryptography), assuring that entities ``know'' what they claim to know, where
adversaries may be well coordinated across different transactions, turns out to
be much more subtle and in need of re-examination. Here, we investigate how to
formally treat knowledge possession by parties (with registered public-keys)
interacting over the Internet. Stated more technically, we look into the
relative power of the notion of ``concurrent knowledge-extraction'' (CKE) in
the concurrent zero-knowledge (CZK) bare public-key (BPK) model.Comment: 38 pages, 4 figure
The Cryptographic Strength of Tamper-Proof Hardware
Tamper-proof hardware has found its way into our everyday life in various forms, be it SIM cards, credit cards or passports. Usually, a cryptographic key is embedded in these hardware tokens that allows the execution of simple cryptographic operations, such as encryption or digital signing. The inherent security guarantees of tamper-proof hardware, however, allow more complex and diverse applications
Efficient UC Commitment Extension with Homomorphism for Free (and Applications)
Homomorphic universally composable (UC) commitments allow for the sender to reveal the result of additions and multiplications of values contained in commitments without revealing the values themselves while assuring the receiver of the correctness of such computation on committed values.
In this work, we construct essentially optimal additively homomorphic UC commitments from any (not necessarily UC or homomorphic) extractable commitment. We obtain amortized linear computational complexity in the length of the input messages and rate 1.
Next, we show how to extend our scheme to also obtain multiplicative homomorphism at the cost of asymptotic optimality but retaining low concrete complexity for practical parameters.
While the previously best constructions use UC oblivious transfer as the main building block, our constructions only require extractable commitments and PRGs, achieving better concrete efficiency and offering new insights into the sufficient conditions for obtaining homomorphic UC commitments.
Moreover, our techniques yield public coin protocols, which are compatible with the Fiat-Shamir heuristic.
These results come at the cost of realizing a restricted version of the homomorphic commitment functionality where the sender is allowed to perform any number of commitments and operations on committed messages but is only allowed to perform a single batch opening of a number of commitments.
Although this functionality seems restrictive, we show that it can be used as a building block for more efficient instantiations of recent protocols for secure multiparty computation and zero knowledge non-interactive arguments of knowledge
PROGNOSTICS OF POLYMER POSITIVE TEMPERATURE COEFFICIENT RESETTABLE FUSES
Polymer positive-temperature-coefficient (PPTC) resettable fuse has been used to circuit-protection designs in computers, automotive circuits, telecommunication devices, and medical devices. PPTC resettable fuse can trip from low resistance to high resistance under over-current conditions. The increase in the resistance decreases the current and protects the circuit. After the abnormal current is removed, and/or power is switched off, the fuse resets to low resistance stage, and can be continuously operated in the circuit. The resettable fuse degrades with the operations resulting in loss or abnormal function of the protection of circuit. This thesis is focused on the prognostics methods for resettable fuses to provide an advance warning of failure and to predict the remaining useful life.
The failure precursor parameters are determined first by systematic analysis using failure modes, mechanisms, and effects analysis (FMMEA) followed by a series of experiments to verify these parameters. Then the causes of the observed failures are determined by failure analyses, including the analyses of interconnections between different parts, the microstructures of the polymer composite, the properties (such as crystallinity) of the polymer composite, and the coefficient of thermal expansion (CTE) of different parts. The revealed failure causes include the cracks and gaps between different parts, the agglomerations of the carbon black particles, the change in crystallinity of the polymer composite, and the CTE-mismatches between different parts.
Cross validation (CV) sequential probability ratio test (CVSPRT) is developed to detect anomalies. CV methods are introduced into SPRT to determine the model parameters without the need of experience and reduce the false and missed alarms. A moving window training updating based dynamic model parameter optimization (MW-DMPO) n-steps-ahead prognostics method is developed to predict the failure. MW methods update the training data for prediction models by a moving window to contain the latest degradation information/data and improve the prediction accuracy. For each updating of the training data, the model parameters for data-trending model are updated dynamically. Based on the developed MW-DMPO method, a MW cross validation support vector regression (MW-CVSVR) n-steps-ahead prediction is developed to predict failures of PPTC resettable fuses in this thesis. The cross validation method is used to determine the proper SVR model parameters. The CVSPRT anomaly detection method and MW-DMPO n-steps-ahead prognostics method developed in this thesis can be extended as general methods for anomaly detection and failure prediction
Quantum and classical resources for unitary design of open-system evolutions
A variety of tasks in quantum control, ranging from purification and cooling to quantum stabilisation and open-system simulation, rely on the ability to implement a target quantum channel over a specified time interval within prescribed accuracy. This can be achieved by engineering a suitable unitary dynamics of the system of interest along with its environment, which, depending on the available level of control, is fully or partly exploited as a coherent quantum controller. After formalising a controllability framework for completely positive trace-preserving quantum dynamics, we provide sufficient conditions on the environment state and dimension that allow for the realisation of relevant classes of quantum channels, including extreme channels, stochastic unitaries or simply any channel. The results hinge on generalisations of Stinespring's dilation via a subsystem principle. In the process, we show that a conjecture by Lloyd on the minimal dimension of the environment required for arbitrary open-system simulation, albeit formally disproved, can in fact be salvaged, provided that classical randomisation is included among the available resources. Existing measurement-based feedback protocols for universal simulation, dynamical decoupling and dissipative state preparation are recast within the proposed coherent framework as concrete applications, and the resources they employ discussed in the light of the general results
- …