699 Hits in 6.3 sec

Secure Computation Based on Leaky Correlations: High Resilience Setting [chapter]

Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen
2017 Lecture Notes in Computer Science  
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  ...  They also constructed an extractor from a large correlation that has 1/2 fractional resilience but produces only one OT, which does not suce to compute even constant size functionalities securely.  ...  For example, in the secure computation setting, the correlation IP (GF [2] n ) is resilient to n/2 bits of leakage but can only produce one OT.  ... 
doi:10.1007/978-3-319-63715-0_1 fatcat:xhc7rqdz3fbwrda2dr4ng2uavy

Extracting Correlations

Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
2009 2009 50th Annual IEEE Symposium on Foundations of Computer Science  
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  ...  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.  ...  For instance, when basing unconditionally secure cryptographic protocols on a physical BSC, correlation extractors can be used to accommodate an imperfect or leaky implementation of the BSC.  ... 
doi:10.1109/focs.2009.56 dblp:conf/focs/IshaiKOS09 fatcat:yfiqpfaqcfbx5gy2asa3t2dhpu

Barriers in cryptography with weak, correlated and leaky sources

Daniel Wichs
2013 Proceedings of the 4th conference on Innovations in Theoretical Computer Science - ITCS '13  
. * IBM Research. The "Paradox" of Cryptography with Imperfect Randomness One of the challenges in proving the security of cryptosystems with imperfect (weak/leaky/correlated) sources  ...  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.  ...  We also thank Yael, Iftach Haitner and Yevgeniy Dodis for many enlightening discussions on the topics and results of this work.  ... 
doi:10.1145/2422436.2422451 dblp:conf/innovations/Wichs13 fatcat:dl5u3ptpgvgnfm4qaw2n2yl3ze

Secure Computation from Leaky Correlated Randomness [chapter]

Divya Gupta, Yuval Ishai, Hemanta K. Maji, Amit Sahai
2015 Lecture Notes in Computer Science  
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?  ...  Remarkably, despite decades of study of OT-based secure computation, very little is known about this question.  ...  In contrast to the setting of privacy amplification, remarkably, despite decades of study of OT-based secure computation, very little is known about our question.  ... 
doi:10.1007/978-3-662-48000-7_34 fatcat:yjtrx45wb5c37f3fi6pq5soja4

Correlated Product Security from Any One-Way Function [chapter]

Brett Hemenway, Steve Lu, Rafail Ostrovsky
2012 Lecture Notes in Computer Science  
It is well-known that the k-wise product of one-way functions remains one-way, but may no longer be when the k inputs are correlated.  ...  At TCC 2009, Rosen and Segev introduced a new notion known as Correlated Product secure functions.  ...  Definition 3 (Decisional Correlated Product Security). Let F = (G, F ) be a collection of efficiently computable functions.  ... 
doi:10.1007/978-3-642-30057-8_33 fatcat:mmws67ktdvfpppllwpsycdxg7i

SoK: Design Tools for Side-Channel-Aware Implementations [article]

Ileana Buhan and Lejla Batina and Yuval Yarom and Patrick Schaumont
2021 arXiv   pre-print
In this SoK, we classify approaches to automated leakage detection based on the model's source of truth.  ...  Side-channel attacks that leak sensitive information through a computing device's interaction with its physical environment have proven to be a severe threat to devices' security, particularly when adversaries  ...  The comparison is made by computing the correlation traces produced by both leakage models on the same reference traces.  ... 
arXiv:2104.08593v2 fatcat:ybvrwhb4xbbdrftfgnmcklo5iu

How to Compute in the Presence of Leakage

Shafi Goldwasser, Guy N. Rothblum
2015 SIAM journal on computing (Print)  
This result is unconditional and does not rely on any secure hardware components.  ...  We address the following problem: how to execute any algorithm P , for an unbounded number of executions, in the presence of an adversary who observes partial information on the internal state of the computation  ...  We note that the construction in [GR10] relied on several similar properties of a computationally secure public-key leakage resilient scheme: the BHHO/Naor-Segev scheme [BHHO08, NS09] .  ... 
doi:10.1137/130931461 fatcat:sfkourrz4feubdsir4pjr7xaga

On hardening leakage resilience of random extractors for instantiations of leakage-resilient cryptographic primitives

Danyang Chen, Yongbin Zhou, Yang Han, Rui Xue, Qing He
2014 Information Sciences  
Taking one leakage-resilient stream cipher presented at FOCS 2008 as a case of study, we not only examine the leakage resilience of the underlying extractor, but also discuss how leakages from the extractor  ...  Nevertheless, recent efforts showed that they are likely more leaky than other elementary components (e.g. block ciphers) in unprotected implementations of these primitives, in the context of side-channel  ...  For example, based on the "Only Computation Leaks" (OCL for short) assumption, [4] constructed a leakage resilient stream cipher using alternating extraction.  ... 
doi:10.1016/j.ins.2014.02.149 fatcat:xyhnlf24dzgrhcidhpufyegzba

Fuzzy Leaky Bucket System for Intelligent Management of Consumer Electricity Elastic Load in Smart Grids

Miltiadis Alamaniotis
2020 Frontiers in Artificial Intelligence  
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.  ...  Based on the definition of the leaky bucket, the bucket itself may be viewed in two different ways.  ... 
doi:10.3389/frai.2020.00001 pmid:33733121 pmcid:PMC7861288 fatcat:722njnsv5banvpzgpn2kmbztxe

Storing Secrets on Continually Leaky Devices

Yevgeniy Dodis, Allison Lewko, Brent Waters, Daniel Wichs
2011 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science  
The security of our scheme is based on the linear assumption in prime-order bilinear groups.  ...  Lastly, we show impossibility of information theoretic sharing schemes in our model, where continually leaky devices update their state individually.  ...  high low mid high Correlated Bases Super-Correlated Bases Uncorrelated Bases Share Updates: To update an sk i in its share, a party chooses A $ ← Rk d (F n×n q ) and derives a matrix A by  ... 
doi:10.1109/focs.2011.35 dblp:conf/focs/DodisLWW11 fatcat:tiahlove5ffvdc2e6etp7yc4km

Fully Leakage-Resilient Signatures

Elette Boyle, Gil Segev, Daniel Wichs
2012 Journal of Cryptology  
Signature schemes satisfying this notion of security were constructed both based on generic cryptographic primitives in the standard model [KV09] and based on the Fiat-Shamir transform [FS86] in the random-oracle  ...  A signature scheme is fully leakage resilient (Katz and Vaikuntanathan, ASIACRYPT '09) if it is existentially unforgeable under an adaptive chosen-message attack even in a setting where an adversary may  ...  Acknowledgements We thank Moni Naor, Brent Waters, and the anonymous referees for many useful comments on this work.  ... 
doi:10.1007/s00145-012-9136-3 fatcat:7sfhg25hqrcx7e4oci5pl7ism4

Practical leakage-resilient pseudorandom generators

Yu Yu, Fran çois-Xavier Standaert, Olivier Pereira, Moti Yung
2010 Proceedings of the 17th ACM conference on Computer and communications security - CCS '10  
Recent works on leakage-resilient PRG and stream ciphers did significant progresses in providing tools for the analysis of side-channel attacks in the standard cryptographic setting.  ...  First, we show that the leakage-resilience of a natural, i.e. conform to engineering experience, stateful PRG can be proven under a random oracle based assumption.  ...  We describe two designs of leakage-resilient stream ciphers in this new setting, either based on the combination of an extractor and a PRG, or based on a single wPRF, as in previous works.  ... 
doi:10.1145/1866307.1866324 dblp:conf/ccs/YuSPY10 fatcat:bdmmghb6s5b23k7wts4h3v7dve

Leakage-Resilient Zero Knowledge [chapter]

Sanjam Garg, Abhishek Jain, Amit Sahai
2011 Lecture Notes in Computer Science  
We give a construction of LR-ZK interactive proof system based on standard general assumptions.  ...  Specifically, we consider a setting where a cheating verifier is allowed to obtain arbitrary bounded leakage on the entire state (including the witness and the random coins) of the prover during the entire  ...  In particular, in this section, we study the feasibility of doing universally composable secure computation using "leaky" tokens.  ... 
doi:10.1007/978-3-642-22792-9_17 fatcat:qgmf2463enahxcjxzsa7y7wibu

Cryptography against Continuous Memory Attacks

Yevgeniy Dodis, Kristiyan Haralambiev, Adriana Lopez-Alt, Daniel Wichs
2010 2010 IEEE 51st Annual Symposium on Foundations of Computer Science  
Security: For any PPT attacker A, we have Pr Ver(pk, sk * ) = 1 (pk, sk) ← KeyGen(1 λ ) sk * ← A(pk) ≤ negl(λ). A one-way relation generalizes the concept of a one-way function (OWF).  ...  Of course, we can always set sk to include all of the randomness of the KeyGen algorithm, so that pk = KeyGen(sk) is a OWF. However,  ...  On a high level, this construction preserves the (continuous) leakage-resilience security of the underlying OWR, since the signatures do not reveal any information about sk.  ... 
doi:10.1109/focs.2010.56 dblp:conf/focs/DodisHLW10 fatcat:7yw4jkpda5axzkrxfzvdffkwla

Special Session: Towards an Agile Design Methodology for Efficient, Reliable, and Secure ML Systems [article]

Shail Dave, Alberto Marchisio, Muhammad Abdullah Hanif, Amira Guesmi, Aviral Shrivastava, Ihsen Alouani, Muhammad Shafique
2022 arXiv   pre-print
and secure ML systems based on user-defined constraints and objectives.  ...  Apart from high efficiency requirements, modern ML systems are expected to be highly reliable against hardware failures as well as secure against adversarial and IP stealing attacks.  ...  Based on an error resiliency analysis, range restriction is employed to achieve high fault tolerant hardware. 4) Cross-Layer Runtime Techniques: During execution, runtime monitoring is conducted to enable  ... 
arXiv:2204.09514v1 fatcat:ho7auszvmferrn36evs7oqdpt4
« Previous Showing results 1 — 15 out of 699 results