Design of a knowledge-based system interfacing with an extrusion cooking process

Call number: LD2668 .R4 EECE 1988 H75Master of ScienceElectrical and Computer Engineerin

Group Signatures and Accountable Ring Signatures from Isogeny-based Assumptions

Group signatures are an important cryptographic primitive providing both anonymity and accountability to signatures. Accountable ring signatures combine features from both ring signatures and group signatures, and can be directly transformed to group signatures. While there exists extensive work on constructing group signatures from various post-quantum assumptions, there has not been any using isogeny-based assumptions. In this work, we propose the first construction of isogeny-based group signatures, which is a direct result of our isogeny-based accountable ring signature. This is also the first construction of accountable ring signatures based on post-quantum assumptions. Our schemes are based on the decisional CSIDH assumption (D-CSIDH) and are proven secure under the random oracle model (ROM)

On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation

Hamiltonian simulation is one of the most important problems in the field of quantum computing. There have been extended efforts on designing algorithms for faster simulation, and the evolution time T for the simulation greatly affect algorithm runtime as expected. While there are some specific types of Hamiltonians that can be fast-forwarded, i.e., simulated within time o(T), for some large classes of Hamiltonians (e.g., all local/sparse Hamiltonians), existing simulation algorithms require running time at least linear in the evolution time T. On the other hand, while there exist lower bounds of ?(T) circuit size for some large classes of Hamiltonian, these lower bounds do not rule out the possibilities of Hamiltonian simulation with large but "low-depth" circuits by running things in parallel. As a result, physical systems with system size scaling with T can potentially do a fast-forwarding simulation. Therefore, it is intriguing whether we can achieve fast Hamiltonian simulation with the power of parallelism. In this work, we give a negative result for the above open problem in various settings. In the oracle model, we prove that there are time-independent sparse Hamiltonians that cannot be simulated via an oracle circuit of depth o(T). In the plain model, relying on the random oracle heuristic, we show that there exist time-independent local Hamiltonians and time-dependent geometrically local Hamiltonians on n qubits that cannot be simulated via an oracle circuit of depth o(T/n^c), where the Hamiltonians act on n qubits, and c is a constant. Lastly, we generalize the above results and show that any simulators that are geometrically local Hamiltonians cannot do the simulation much faster than parallel quantum algorithms

On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model

Time-lock puzzles wrap a solution $\mathrm{s}$ inside a puzzle $\mathrm{P}$ in such a way that ``solving\u27\u27 $\mathrm{P}$ to find $\mathrm{s}$ requires significantly more time than generating the pair $(\mathrm{s},\mathrm{P})$, even if the adversary has access to parallel computing; hence it can be thought of as sending a message $\mathrm{s}$ to the future. It is known [Mahmoody, Moran, Vadhan, Crypto\u2711] that when the source of hardness is only a random oracle, then any puzzle generator with $n$ queries can be (efficiently) broken by an adversary in $O(n)$ rounds of queries to the oracle. In this work, we revisit time-lock puzzles in a quantum world by allowing the parties to use quantum computing and, in particular, access the random oracle in quantum superposition. An interesting setting is when the puzzle generator is efficient and classical, while the solver (who might be an entity developed in the future) is quantum powered and is supposed to need a long sequential time to succeed. We prove that in this setting there is no construction of time-lock puzzles solely from quantum (accessible) random oracles. In particular, for any $n$-query classical puzzle generator, our attack only asks $O(n)$ (also classical) queries to the random oracle, even though it does indeed run in quantum polynomial time if the honest puzzle solver needs quantum computing. Assuming perfect completeness, we also show how to make the above attack run in exactly $n$ rounds while asking a total of $m\cdot n$ queries where $m$ is the query complexity of the puzzle solver. This is indeed tight in the round complexity, as we also prove that a classical puzzle scheme of Mahmoody et al. is also secure against quantum solvers who ask $n-1$ rounds of queries. In fact, even for the fully classical case, our attack quantitatively improves the total queries of the attack of Mahmoody et al. for the case of perfect completeness from $\Omega(mn \log n)$ to $mn$. Finally, assuming perfect completeness, we present an attack in the ``dual\u27\u27 setting in which the puzzle generator is quantum while the solver is classical. We then ask whether one can extend our classical-query attack to the fully quantum setting, in which both the puzzle generator and the solver could be quantum. We show a barrier for proving such results unconditionally. In particular, we show that if the folklore simulation conjecture, first formally stated by Aaronson and Ambainis [arXiv\u272009] is false, then there is indeed a time-lock puzzle in the quantum random oracle model that cannot be broken by classical adversaries. This result improves the previous barrier of Austrin et. al [Crypto\u2722] about key agreements (that can have interactions in both directions) to time-lock puzzles (that only include unidirectional communication)

Site classification and Vs30 estimation of free-field TSMIP stations using the logging data of EGDT

The Engineering Geological Database for TSMIP (EGDT), the Taiwan Strong Motion Instrumentation Program, has been under construction by the National Center for Research on Earthquake Engineering and the Central Weather Bureau in Taiwan since 2000. Site characterization, comprising surface investigations and logging measurements, was carried out throughout the project. We provide a set of specifications and a description to help users understand the subject matter of the database. EGDT contains 469 surveyed stations, 439 of which were drilled and the logging measurements completed. Of these, 385 had logging data reaching at least 30 m, and we used these to examine and determine the most accurate extrapolation of Vs30 (the average S-wave velocity of the top 30 m of strata) for the other 54 stations with velocity profiles less than 30 m. The chosen method assumed that the bottom velocity is identical from the actual depth of the hole to a distance of 30 m, that is, the Bottom Constant Velocity (BCV) method. In order to utilize other existing boreholes which have only N values but no velocities in the future, the empirical S-wave velocity equations for seven different regions and the whole of Taiwan were evaluated by a multivariable analysis. Henceforth, for those existing boreholes which have an N profile less than 30 m, the S-wave velocity profile can first be calculated by empirical S-wave velocity equations, and then Vs30 can be estimated by reliable extrapolation. Some other studies of site classifications of TSMIP stations were compared with our results to demonstrate the necessity of reclassification. Ultimately, the Vs30 values of the 439 drilled free-field TSMIP stations were derived and the new site classification was achieved according to the Vs30-based provisions of the National Earthquake Hazards Reduction Program

Low Cost Seismic Network Practical Applications for Producing Quick Shaking Maps in Taiwan

Two major earthquakes of ML greater than 6.0 occurred in Taiwan in the first half of 2013. The vibrant shaking brought landslides, falling rocks and casualties. This paper presents a seismic network developed by National Taiwan University (NTU) with 401 Micro-Electro Mechanical System (MEMS) accelerators. The network recorded high quality strong motion signals from the two events and produced delicate shaking maps within one minute after the earthquake occurrence. The high shaking regions of the intensity map produced by the NTU system suggest damage and casualty locations. Equipped with a dense array of MEMS accelerometers, the NTU system is able to accommodate 10% signals loss from part of the seismic stations and maintain its normal functions for producing shaking maps. The system also has the potential to identify the rupture direction which is one of the key indices used to estimate possible damage. The low cost MEMS accelerator array shows its potential in real-time earthquake shaking map generation and damage avoidance