A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Secure Computation from Leaky Correlated Randomness
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
Viewed through the lens of information-theoretic cryptography, almost all nontrivial twoparty secure computation requires a-priori correlated randomness to be given to parties. ...
We then ask the same question for other correlations: is there a correlation that is more leakage-resilient than OT correlations, and also supports secure computation? ...
Random OT correlations can be pre-computed in an offline phase and later used online to perform a desired secure computation. ...
doi:10.1007/978-3-662-48000-7_34
fatcat:yjtrx45wb5c37f3fi6pq5soja4
Correlation Extractors and Their Applications
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
[Wyn75,Csi81,…, CK88,…]
• Noise can be "dirty" or "leaky"
• Can we build a clean BSC from a dirty BSC? ...
for protecting Alice.BobOT OT OT OT OT OT -biased secure computation
• Goal: Alice ...
-biased protocol for AND m • a'b'+z is the suffix of a random codeword from C 2 which starts with ab reveals no info beyond ab -Good distance of C 2 guarantees that ab can be recovered ...
doi:10.1007/978-3-642-20728-0_1
fatcat:hyacwudmsbct5m5jtyatut2yxe
Extracting Correlations
2009
2009 50th Annual IEEE Symposium on Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We introduce the notion of correlation extractors, which extract nearly perfect independent instances of a given joint distribution from imperfect, or "leaky," instances of the same distribution. ...
The security of the protocol relies on a number-theoretic intractability assumption. • A constant-rate unconditionally secure construction of oblivious transfer (for semi-honest parties) from any nontrivial ...
from secure computation protocols. ...
doi:10.1109/focs.2009.56
dblp:conf/focs/IshaiKOS09
fatcat:yfiqpfaqcfbx5gy2asa3t2dhpu
Gate-Level Side-Channel Leakage Assessment with Architecture Correlation Analysis
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The methodology relies on logic synthesis, logic simulation, gate-level power estimation, and gate leakage assessment to compute a ranking. ...
While side-channel leakage is traditionally evaluated from a fabricated chip, it is more time-efficient and cost-effective to do so during the design phase of the chip. ...
All cells in the design are ranked according to their C i from most leaky to least leaky. ...
arXiv:2204.11972v1
fatcat:6dijvl2lnrd7tb37xn3kcok27q
TinyKeys: A New Approach to Efficient Multi-Party Computation
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our central idea is to take a protocol which is secure for n − 1 corruptions and modify it to use short symmetric keys, with the aim of basing security on the concatenation of all honest parties' keys. ...
We present a new approach to designing concretely efficient MPC protocols with semi-honest security in the dishonest majority setting. ...
Recall from the analysis in Section 3.1 that when using protocol Π Leaky-2-Mult with Π Triple , the cost of computing r secret-shared triples is that of random, correlated OTs on r-bit strings, and a further ...
doi:10.1007/978-3-319-96878-0_1
fatcat:k7xjoou2ifcjvfol443kkblsrm
Secure Computation Using Leaky Tokens
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our main result is a completeness theorem that shows that every nontrivial leaky two-party functionality can be used for general secure computation. ...
In this paper, we study the feasibility of general two-party computation using leaky hardware tokens. ...
We construct a non-interactive, unconditionally secure general two-party secure computation protocol in the leaky token hybrid model. ...
doi:10.1007/978-3-662-43948-7_75
fatcat:7pr2e5sz4jflrjsqgziyufciwy
A Quantitative, Experimental Approach to Measuring Processor Side-Channel Security
2013
IEEE Micro
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Through complex post-processing, attackers can gain a surprising amount of information from such data. Side-channel exploits affect a variety of important domains. ...
At the other end of the spectrum, mobile phones and other embedded systemswhich are used for everything from authentication to accounting to entertainment systems-hold a lot of sensitive information and ...
To measure leakiness, we simply want to compute the correlation between these two pieces of information. ...
doi:10.1109/mm.2013.23
fatcat:3l6idf5w3rbe3gg32vhiaigxfa
Secure Computation Based on Leaky Correlations: High Resilience Setting
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Correlated private randomness, or correlation in short, is a fundamental cryptographic resource that helps parties compute securely over their private data. ...
Correlation extractors are interactive protocols that take leaky correlations as input and produce secure independent copies of oblivious transfer (OT), the building blocks of secure computation protocols ...
Our correlation extractor securely computes a sample from the ROLE (K) correlation. ...
doi:10.1007/978-3-319-63715-0_1
fatcat:xhc7rqdz3fbwrda2dr4ng2uavy
Barriers in cryptography with weak, correlated and leaky sources
2013
Proceedings of the 4th conference on Innovations in Theoretical Computer Science - ITCS '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
For example, we are unable to prove the security of basic tools for manipulating weak/leaky random sources, such as as pseudo-entropy generators and seed-dependent computational condensers. ...
. * IBM Research. wichs@cs.nyu.edu The "Paradox" of Cryptography with Imperfect Randomness One of the challenges in proving the security of cryptosystems with imperfect (weak/leaky/correlated) sources ...
The first such tool is a pseudo-entropy generator which takes a random seed x from a weak or leaky distribution and outputs a longer value y = PEG(x) such that the computational entropy of y is greater ...
doi:10.1145/2422436.2422451
dblp:conf/innovations/Wichs13
fatcat:dl5u3ptpgvgnfm4qaw2n2yl3ze
Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The distinction from the standard notion of randomness condensers is that the source X may be correlated with the seed S (but is restricted to be efficiently samplable). ...
We show that: -Unlike extractors, we can have randomness condensers for samplable, seed-dependent sources whose computational complexity is smaller than the size t of the adversarial sampling algorithm ...
be affected by the internal computations of the RNG itself and thus we have correlations between the seed and the sources. ...
doi:10.1007/978-3-642-28914-9_35
fatcat:j7a26ai725hflbqcncy3fccd44
S++: A Fast and Deployable Secure-Computation Framework for Privacy-Preserving Neural Network Training
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We introduce S++, a simple, robust, and deployable framework for training a neural network (NN) using private data from multiple sources, using secret-shared secure function evaluation. ...
In recent times, ReLU has been found to converge much faster and be more computationally efficient as compared to non-linear functions like sigmoid or tanh. ...
Despite ReLU being more computationally efficient than logistic sigmoid or tanh (Krizhevsky, Sutskever, and Hinton 2017) , we argue that it is worth extending the secure computation protocol to popular ...
arXiv:2101.12078v1
fatcat:tgkwno5xwnfmxh6qrmdnh6ke2y
A New Approach to Practical Active-Secure Two-Party Computation
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yao's garbled circuits. ...
We use an OT-based approach and get efficiency via OT extension in the random oracle model. ...
This correlation can be easily broken using the random oracle. ...
arXiv:1202.3052v1
fatcat:sttk5ycygjb2ratq3n6jyeoery
Correlated Product Security from Any One-Way Function
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Rosen and Segev gave a construction of injective trapdoor functions which were correlated product secure from the existence of Lossy Trapdoor Functions (introduced by Peikert and Waters in STOC 2008). ...
At TCC 2009, Rosen and Segev introduced a new notion known as Correlated Product secure functions. ...
To see that a PRIV1 secure DE need not be n-DCP secure, take any IND-CPA secure (randomized) encryption scheme, and transform it into a "leaky" scheme that leaks the first bit of randomness used in encryption ...
doi:10.1007/978-3-642-30057-8_33
fatcat:mmws67ktdvfpppllwpsycdxg7i
Fuzzy Leaky Bucket System for Intelligent Management of Consumer Electricity Elastic Load in Smart Grids
2020
Frontiers in Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The developed system is applied on a set of real-world electricity consumption data taken from a residential consumer, and benchmarked against a full scheduling method, where the elastic load is fully ...
To that end, a fuzzy algorithm comprised of a set of rules is developed to manage the token rate of the leaky bucket and through that the decisions over the fate of elastic loads. ...
., no fuzzy leaky bucket is used) is also computed and shown in Figure 13 as well. ...
doi:10.3389/frai.2020.00001
pmid:33733121
pmcid:PMC7861288
fatcat:722njnsv5banvpzgpn2kmbztxe
Quantitative Verification of Masked Arithmetic Programs against Side-Channel Attacks
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In case that the program is not perfectly masked, we also provide a method to quantify the security level of the program. ...
Then, it computes k 3 by a secure multiplication of two pairs of shares (x 0 , x 1 ) and (x, r 0 ) using the random variable r 1 (Lines 5-12). ...
Computing QMS. Columns 7-9 in Table 3 show the results of computing QMS values of leaky variables, where Column 7 (resp. ...
arXiv:1901.09706v1
fatcat:epgbckauinbkzhmka26gf2235u
« Previous
Showing results 1 — 15 out of 2,467 results