[PDF] Top 20 On the Round Complexity of OT Extension
Has 10000 "On the Round Complexity of OT Extension" found on our website. Below are the top 20 most common "On the Round Complexity of OT Extension".
On the Round Complexity of OT Extension
... In this section, we explain the key ideas behind the proof of our main impossi- bility result of Theorem 1. For a formal treatment, see Section 3. In a nutshell, we first present an entropy-based information-theoretic ... See full document
33
On the Exact Round Complexity of Secure Three-Party Computation
... exact round complex- ity is yet another measure that sets apart the protocols with three parties over the ones with two ...possible round complexity of 2 ... See full document
70
Meet-in-the-Middle Attacks on Reduced-Round Midori-64
... time complexity of this phase is about 2 120+5−3 = 2 122 11-round Midori-64 encryptions, the data complexity is 2 24+29 = 2 53 chosen-plaintexts and the memory complexity is 2 53 64-bit ... See full document
21
Combining Private Set-Intersection with Secure Two-Party Computation
... favourable complexity in the input ...secure OT-extension protocol such as [ALSZ15, KOS15] would result in a protocol with privacy but not correctness ... See full document
30
Distributed PageRank Computation: An Improved Theoretical Study
... There have been a number of works on distributed PageR- ank algorithms (Guo et al. 2017; Sarma et al. 2015; Zhu, Ye, and Li 2005). Among them, the algorithm presented in (Sarma et al. 2015) has the best complexity ... See full document
8
Fair Round Robin: A Low Complexity Packet Scheduler with Proportional and Worst Case Fairness
... Arbiters have many types that differ in fairness. The first type is the fixed priority arbiter in which the priority does not change over time; Instead, it is assigned linearly to the requester. It does not grantee any ... See full document
8
Efficient One-Sided Adaptively Secure Computation
... secure OT and adaptively secure two-party ...communication complexity of the second message is O(m log m +n) where m is the message length and n is the security parameter, which improves over all prior ... See full document
43
Faster Private Set Intersection based on OT Extension
... Public-Key-Based PSI For the public-key-based PSI protocols, we observe that the DH-based protocol of [32] outperforms the RSA-based protocol of [16] when using finite field cryptography (FFC). Similarly to [1], we also ... See full document
21
The complexity of reasoning for fragments of default logic
... For [B] ∈ { N , N 2 , L , L 0 , L 3 }, we guess similarly as in Theorem 5.4 a set G of defaults and then verify in the same way whether W and G generate a stable extension E. If not, then we accept. Otherwise, we ... See full document
20
TWORAM: Round-Optimal Oblivious RAM with Applications to Searchable Encryption
... worst-case complexity. Williams and Sion [38] and Fletcher et al. [10] devise round-optimal ORAM schemes that are efficient in an amortized sense, yet their worst-case bandwidth overhead is at least linear ... See full document
29
Actively Secure OT-Extension from q-ary Linear Codes
... communication complexity of what we have called the encoding and consistency check phases of the protocol since we need to send a masking of codewords over a larger ...communication complexity of this phase ... See full document
17
Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs
... practical OT extension ...extend OT in a black-box manner, using only a hash function which satisfies a correlation robustness assumption (or a random ...communication complexity of this ... See full document
30
Efficient k-out-of-n oblivious transfer protocol
... In an oblivious transfer scheme, the performance criteria involve sender's computational effort and receiver's computa- tional effort as well as the communicational cost between the sender and the receiver. The ... See full document
5
Region Filling and Object Removal in Images using Criminisi Algorithm
... natural extension of image inpainting algorithms and it has garnered a great deal of attention due to its applications in video error concealment in video transmission, multimedia editing and visualization, video ... See full document
7
Community knowledge and the role of health extension workers on integrated diseases among households in East Hararghe Zone, Ethiopia
... Background: Ethiopia constitutes approximately 1% of the world’s population but it contributes to 7% of the world’s HIV/AIDS cases. Malaria is the most important disease of humans in terms of mortality, morbidity, and ... See full document
8
Effect of Chain Extension on Thermal Stability Behaviors of Polylactide Bioplastics
... oligomeric agent, was used as a chain extender. Differential scanning calorimetry and thermogravimetry were used to determine the thermal transition properties and thermal stability of the chain extended PLL, ... See full document
7
OT Practitioners’ and OT Students’ Perceptions of Entry-Level Competency for Occupational Therapy Practice
... the OT students’ responses regarding entry-level competency may have been influenced by their own ...the OT student participants’ responses or as one of the OT-related competencies, future studies ... See full document
15
The Effect of Characteristics, Complexity and Audit Findings on the Level of Disclosure of the Local Government's Financial Statements with the Internal Control System as Moderating Variable
... region, complexity proxied by the number of legislative members and audit findings on the level of disclosure of Regional Government financial statements, and also see whether the internal control system can ... See full document
8
Efficient Bit-parallel Multiplication with Subquadratic Space Complexity in Binary Extension Field
... space complexity and power ...time complexity of these multipliers are not shown in the result table, their space complexity are better than the methods reviewed in ... See full document
98
Trifonov, Trifon (2012): Analysis of methods for extraction of programs from non-constructive proofs. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... the complexity of the ...time complexity of a direct ...worst-case complexity, we can obtain a program of the same average behaviour from a classical proof, which is easier to dene than its ... See full document
182
Related subjects