نتایج جستجو برای: verification is not verifiable

تعداد نتایج: 7944505  

2006
Fatemeh Alavizadeh Marjan Sirjani

Designing a correct model for distributed and reactive systems is the first goal of using Rebeca modeling language as an actor-based language supported by a formal verification tool. This paper proposes a method to perform formal verification of reactive systems at the early stages of the design cycle. We propose a UML profile for modeling systems consisting of reactive objects which are commun...

2016
Berry Schoenmakers Meilof Veeningen Niels de Vreede

Verifiable computation allows a client to outsource computations to a worker with a cryptographic proof of correctness of the result that can be verified faster than performing the computation. Recently, the Pinocchio system achieved faster verification than computation in practice for the first time. Unfortunately, Pinocchio and other efficient verifiable computation systems require the client...

2017
Meilof Veeningen

Pinocchio is a practical zk-SNARK that allows a prover to perform cryptographically verifiable computations with verification effort potentially less than performing the computation itself. A recent proposal showed how to make Pinocchio adaptive (or “hash-and-prove”), i.e., to enable proofs with respect to computation-independent commitments. This enables computations to be chosen after the com...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان تهران - دانشکده حقوق 1389

if the precise implementation of the principle of proportion and:balance between the violation and the penalty as well as the other dimensions could be considered as a stick yard for the imptementation of justice any lack of preciseness in carrying out such principle would not indeed be much too far from injustice . naturally ,if it would be imagined that the objective of balance between...

2010
Jordi Puiggali Sandra Guasch

Implementing a transparent audit process when an election is conducted by electronic means is of paramount importance. Universally verifiable mixnets are focused on providing such a property by means of cryptographic proofs verifiable by any auditor. While some of these systems require high amount of computing resources that make them inefficient for real elections, others proposals reduce the ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه یاسوج - دانشکده ادبیات و علوم انسانی 1392

an investigation into oral interaction in language classes: a conversation analytic point of view the aim of this thesis is to analyze the interaction between language teachers and students in english language institutes. this work is done in the context of yasuj city. learning another language, which is in most cases english, involves many variables. one of these variables is the linguistic...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه امام رضا علیه السلام - دانشکده ادبیات و زبانهای خارجی 1391

translation studies have become an accepted academic subject and books, journals and doctoral dissertations appear faster than one can read them all (bassnet and lefevere, 1990). but this field also brought with itself so many other issues which needed to be investigated more, in the heart of which, issues like ideology, ethics, culture, bilingualism and multilingualism. it is reported that ove...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علامه طباطبایی - دانشکده ادبیات و زبانهای خارجی 1389

abstract tasks nowadays are at the center of attention in sla research. task types is one of the critical issues in this regard, their effectiveness and suitability to any particular context, their characteristics and the result they yield are among some of these issues. on the other hand, discourse markers (dms) have been very much investigated and their effectiveness in conveying the meaning...

1996
Mike Burmester

Franklin and Reiter introduced at Eurocrypt '95 verifiable signature sharing, a primitive for a fault tolerant distribution of signature verification. They proposed various praclical protocols. For RSA signatures with exponent e = 3 and n processors their protocol allows for up to (n 1)/5 faulty processors (in general (n 1)/(2 + e)). We consider a new unifying approach which uses homomorphisms ...

2015
Dominique Schröder Mark Simkin

In a Verifiable Data Streaming (VDS) protocol a computationally weak client outsources his storage to an untrusted storage provider. Later, the client can efficiently append and update data elements in the already outsourced and authenticated data set. Other users can stream arbitrary subsets of the authenticated data and verify their integrity on-the-fly, using the data owner’s public verifica...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید