Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 127 for “"succinct"”.
-
Succinct non-Interactive arguments
Succinct non-interactive arguments (SNARGs), also known as "CS proofs" [Micali, FOCS 1994], enable verifying NP statements with much lower complexity than required for classical NP verification (in fact, with complexity that is independent of the NP language at hand). In particular, SNARGs provide …
-
Succinct Cryptography via Propositional Proofs
… assumptions which achieve the ideal levels of succinctness. However, there are still some tasks in cryptography where achieving the “ideal” efficiency from standard assumptions has evaded us. In this thesis, we study the problem of achieving succinctness in two such settings: • Can we construct …
-
Finding Succinct Representations For Clusters
… Davidson et al., and Sambaturu et al., based on succinct representations of clusters. Given a set of objects S, a partition of S (into clusters), and a universe T of descriptors such that each element in S is associated with a subset of descriptors, the goal is to find a representative set of …
-
On deploying succinct zero-knowledge proofs
… it is crucial that proofs be non-interactive and succinct. In the standard model, non-interactive zero-knowledge (NIZK) proofs do not exist for languages outside BPP (even with just computational soundness). However, if the security model includes a trusted party, available for a one-time setup …
-
Succinct garbled RAM from indistinguishablity obfuscation
… this thesis, I give the first construction of a succinct garbling scheme for RAM programs. For a program requiring space S and time T to compute, the size of its garbling is Õ(S) instead of poly(T). This construction relies on the existence of indistinguishability obfuscation, as well as the …
-
Inducing succinct rules in machine learning problems
Machine Learning techniques, in particular induction algorithms, have been applied to the field of expert systems development in an effort to overcome the knowledge acquisition bottleneck. Many different induction algorithms have been developed. These utilise a number of different knowledge …
-
Succinct publicly auditable MPC with universal setup
… robust MPC that supports fast verification, succinct proof size with one time universal, and updatable setup. Importantly,we provide auditability without significantly compromising the performance of the underlying Shamir secret shared MPC protocol, i.e, adding auditability only incurs a …
-
Succinct non-interactive arguments for bounded depth computations
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms
-
Universal and succinct source coding of deep neural networks
Deep neural networks have shown incredible performance for inference tasks in a variety of domains. Unfortunately, most current deep networks are enormous cloud-based structures that require significant storage space, which limits scaling of deep learning as a service (DLaaS) and use for on-device …
-
Reasoning about history based access control policy using past time operators of interval temporal logic
… make specifications referring to history more succinct; that is, there are classes of properties that can be expressed by means of much shorter formulas. What is more, statements are easier to express (simplicity) when past operators are included. Moreover, using past operators does not …
-
Rate-1 non-interactive arguments for batch-NP
Succinct non-interactive arguments for batch-NP computations, called BARGs (Choudhuri, Jain and Jin, STOC 2021), have emerged as a powerful tool to construct succinct non-interactive arguments (SNARGs) for expressive classes of computations such as all deterministic computations (P), time-space …
-
On the power of nondeterminism in small two-way finite automata
… finite automata (NFAS) can be exponentially more succinct than two-way deterministic ones (2DFAS); equivalently, that no polynomial-size sequence of 2DFAs can recognize B, for B a particular sequence of regular languages that is among the hardest of those recognizable by polynomial-size sequences …
-
SNARKs for C : verifying program executions succinctly and in zero knowledge
… first practical realization of a zero-knowledge Succinct Non-interactive ARgument of Knowledge (zk-SNARK) for program executions, in the preprocessing model. This cryptographic primitive is a powerful solution for delegating N P computations, and enjoys many features not achieved by primitives …
-
On Ezra Pound's Translation of Classical Chinese Poetry in Cathay
… the sharp imagery, the precise diction, and the succinct style of the source texts, which has enable Cathay to become a popular collection of translation since its first publication in 1915.
-
Functional signatures
… of functional signature in constructing succinct non-interactive arguments and delegation schemes. We give several constructions for this primitive, and describe the trade-offs between them in terms of the assumptions they require and the size of the signatures.
-
Early maladaptive schemas and parental bonding in skin disease: investigating the role of schemas and early attachment in Greek patients with psoriasis and eczema
… abuse. This case study focuses on providing a succinct overview of the schema model and its application in a long-term therapeutic relationship. The initial assessment and schema case conceptualisation is presented, followed by a summary of sessions, including interventions and difficulties …
-
DC thyristor circuit breakers: An investigation of current interruption ability
… generalized analysis was developed which enabled succinct assessment of the current interruption performance of different thyristor circuit breaker configurations. A 250V, 60A DC Thyristor Circuit Breaker was analysed and a study of TCB-system interaction was made. A novel thyristor circuit …
-
Approximation of Multiobjective Optimization Problems
… We develop efficient algorithms for the succinct approximation of the Pareto set for a large class of multiobjective problems. First, we investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective …
-
Criança em situação de vulnerabilidade social: desafios do educador social
… risk; The intra-family violence, as well as succinct scores on childhood sociology, culminating in a debate about the social educator and his pedagogical practice. For conceptualizations, we highlight authors such as Antoni Petrus, Jaume Trilla in Profissão Educador Social, in addition to …
-
Current patterns and future directions in parent education: A Delphi study
… Ideas that were similar were combined into succinct representative statements by the researcher. In Round II, participants used a Likert-type scale to indicate agreement with the statements. The Round III questionnaire, composed of the 10 patterns and 11 directions receiving highest means …
Page 1 of 7