Filters








354,323 Hits in 7.1 sec

Secure Computation of Randomized Functions: Further Results [article]

Deepesh Data, Vinod M. Prabhakaran
2017 arXiv   pre-print
We consider secure computation of randomized functions between two users, where both the users (Alice and Bob) have inputs, Alice sends a message to Bob over a rate-limited, noise-free link, and then Bob  ...  For the first problem, we also explicitly characterize securely computable randomized functions when input has full support, which leads to a much simpler expression for the optimal rate.  ...  The study of secure computation was initiated in [1] , [2] , [3] , [4] , etc., under computational assumptions, and culminated in a surprising result that, every function (both deterministic and randomized  ... 
arXiv:1705.07081v1 fatcat:zuxpilcqk5e3bni2gs3b6bfrty

Secure computation of randomized functions

Deepesh Data
2016 2016 IEEE International Symposium on Information Theory (ISIT)  
Two user secure computation of randomized functions is considered, where only one user computes the output.  ...  In perfect security setting Kilian [STOC 2000] gave a characterization of securely computable randomized functions, and we provide rate-optimal protocols for such functions.  ...  Prabhakaran for many helpful discussions and his help in improving the presentation of this paper. The research was supported in part by a Microsoft Research India Ph.D. Fellowship.  ... 
doi:10.1109/isit.2016.7541860 dblp:conf/isit/Data16 fatcat:wjtmam2swneupdx4czi3x3hcae

Limits of random oracles in secure computation

Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran
2014 Proceedings of the 5th conference on Innovations in theoretical computer science - ITCS '14  
Technically, our main result establishes the limitations of random oracles for secure computation.  ...  Further, in the setting of active adversaries, a deterministic SFE functionality f has a (UC or standalone) statistically secure protocol in the random oracle model if and only if f has a (UC or standalone  ...  This result has important implications in understanding the "complexity" of secure function evaluation functionalities vis a vis computational primitives like one-way functions.  ... 
doi:10.1145/2554797.2554801 dblp:conf/innovations/MahmoodyMP14 fatcat:fhczfcvajzb7dnno5wyjopgfcm

Limits of Random Oracles in Secure Computation [article]

Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran
2012 arXiv   pre-print
Technically, our main result establishes the limitations of random oracles for secure computation.  ...  using one-way functions as the sole source of computational hardness.  ...  This result has important implications in understanding the "complexity" of secure function evaluation functionalities vis a vis computational primitives like one-way functions.  ... 
arXiv:1205.3554v1 fatcat:l2ototrwf5bavfcbubrsnt2bi4

Efficient Amplification of the Security of Weak Pseudo-random Function Generators [chapter]

Steven Myers
2001 Lecture Notes in Computer Science  
Using results of Luby and Rackoff, this result also demonstrates how to "naturally" construct a PRPG from partially secure PRPG.  ...  G and ri are strings of random bits.  ...  Intuitively, the lemma shows that the function generator which results from the combination of two partially secure function generators by the ✸ operator generator is more secure than either of the two  ... 
doi:10.1007/3-540-44987-6_22 fatcat:a4pzvmdbfbb5vmldfnfu23cdpm

Silicon physical random functions

Blaise Gassend, Dwaine Clarke, Marten van Dijk, Srinivas Devadas
2002 Proceedings of the 9th ACM conference on Computer and communications security - CCS '02  
HOST Physical Unclonable Functions I ECE 495/595 ECE UNM 2 (10/21/13) PUF Definitions "A Physical Random Function (PUF) is a function that maps challenges to responses, that is embodied by a physical device  ...  Unclonable Functions I ECE 495/595 ECE UNM 18 (10/21/13) PUF Implementations (digital variants) Arbiter PUF (delay-based) Note that setup and hold times of the arbiter are likely violated often, resulting  ...  When proposing one of your own, keep the following evaluation metrics in mind: • Report sample size and level of significance in your resultsCompute inter-and intra-distance histograms and run statistical  ... 
doi:10.1145/586110.586132 dblp:conf/ccs/GassendCDD02 fatcat:e4oz6ddncngprdlg5w34fxajxq

Silicon physical random functions

Blaise Gassend, Dwaine Clarke, Marten van Dijk, Srinivas Devadas
2002 Proceedings of the 9th ACM conference on Computer and communications security - CCS '02  
HOST Physical Unclonable Functions I ECE 495/595 ECE UNM 2 (10/21/13) PUF Definitions "A Physical Random Function (PUF) is a function that maps challenges to responses, that is embodied by a physical device  ...  Unclonable Functions I ECE 495/595 ECE UNM 18 (10/21/13) PUF Implementations (digital variants) Arbiter PUF (delay-based) Note that setup and hold times of the arbiter are likely violated often, resulting  ...  When proposing one of your own, keep the following evaluation metrics in mind: • Report sample size and level of significance in your resultsCompute inter-and intra-distance histograms and run statistical  ... 
doi:10.1145/586131.586132 fatcat:7omrk53e3jg7dobwez6lawmyzy

Secure and efficient random functions with variable-length output

Yan Zhu, Di Ma, Changjun Hu, Gail-Joon Ahn, Hongxin Hu
2014 Journal of Network and Computer Applications  
Provable security is provided by privacy property in hidden number problem and Hard-core unpredication of one-way function.  ...  The experiment results show that these schemes have better performance under different input and output lengths. We perform four types of statistical tests for randomness.  ...  for PRG function is that the output of pseudorandom sequences should be computationally indistinguishable from truly random sequences.  ... 
doi:10.1016/j.jnca.2014.07.033 fatcat:dppddqphtfeajen7rzr4wdw5ay

On the Power of Correlated Randomness in Secure Computation [chapter]

Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, Anat Paskin-Cherniavsky
2013 Lecture Notes in Computer Science  
We settle the above questions, obtaining both positive and negative results on unconditionally secure computation with correlated randomness. Concretely, we obtain the following results.  ...  We investigate the extent to which correlated secret randomness can help in secure computation with no honest majority.  ...  Our result is based on a general approach for transforming perfectly secure protocols for sender-receiver functionalities in the preprocessing model into (computationally) secure protocols in the plain  ... 
doi:10.1007/978-3-642-36594-2_34 fatcat:qotanshyobbvrmp4ihyoiacbxe

Assisted common information: Further results

Vinod M. Prabhakaran, Manoj M. Prabhakaran
2011 2011 IEEE International Symposium on Information Theory Proceedings  
In this note we present further results. We explore the connection of assisted common information with the Gray-Wyner system.  ...  The motivation for our formulation was to improve upperbounds on the efficiency of protocols for secure two-party sampling (which is a form of secure multi-party computation).  ...  Distributed dependent random variables are an important resource in the cryptographic task of secure multi-party computation.  ... 
doi:10.1109/isit.2011.6034098 dblp:conf/isit/PrabhakaranP11 fatcat:5vasoh756vcfnkembhzd6y7veu

Design and Implementation of the AEGIS Single-Chip Secure Processor Using Physical Random Functions

G. Edward Suh, Charles W. O'Donnell, Ishan Sachdev, Srinivas Devadas
2005 SIGARCH Computer Architecture News  
By using Physical Random Functions, we propose a new way of reliably protecting and sharing secrets that is more secure than existing solutions based on non-volatile memory.  ...  Finally, we evaluate a fully functional FPGA implementation of our processor, assess the implementation tradeoffs, compare performance, and demonstrate the benefits of partially protecting a program.  ...  A Physical Random Function (PUF) is a function that maps a set of challenges to a set of responses based on an intractably complex physical system.  ... 
doi:10.1145/1080695.1069974 fatcat:ghxqvdd4cnhe7gzxrz7mhg4hxu

On the Security of Random Sources [chapter]

Jean -Sebastien Coron
1999 Lecture Notes in Computer Science  
Many applications rely on the security of their random number generator. It is therefore essential that such devices be extensively tested for malfunction.  ...  The test is based on the computation of a function which is asymptotically related to the source's entropy, which measures the effective key-size of block ciphers keyed by the source's output.  ...  DSA) or protocols (e.g. zero-knowledge), random numbers are intrinsic to the computation. In all these applications, security tightly depends on the randomness of the source.  ... 
doi:10.1007/3-540-49162-7_3 fatcat:u5ydkisxmvg7zmf55fjqmiwcma

The Limits of Common Coins: Further Results [chapter]

Hemanta K. Maji, Manoj Prabhakaran
2011 Lecture Notes in Computer Science  
Further it was shown that for F coin to be useful in securely realizing any one in a a large class of symmetric SFE (SSFE) functionalities, a certain computational assumption (namely the existence of a  ...  In this work, we close a gap in the class of SSFE functionalities for which this result was proven in [8]: we show that F coin can be used to securely realize any SSFE functionality that cannot be realized  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.  ... 
doi:10.1007/978-3-642-25578-6_25 fatcat:l5ftfeeipfchbj3ghj2e3ngkeq

Public-Key Encryption Secure Against Related Randomness Attacks for Improved End-to-End Security of Cloud/Edge Computing

Pengtao Liu
2020 IEEE Access  
Public-key encryption is often used to protect data security/privacy and secure communication in scenarios of cloud computing and edge computing.  ...  This paper proposes some methods of constructing secure public-key encryption scheme against related randomness attacks, i.e.  ...  Schuldt and Shinagawa [29] analyzed the related-randomness security about RSA-OAEP and gave a positive result.  ... 
doi:10.1109/access.2020.2967457 fatcat:lekze4p3cve55nve3fu2bcfchm

The Role of Interaction and Common Randomness in Two-User Secure Computation

Gowtham R. Kurri, Vinod M. Prabhakaran, Jithin Ravi
2018 2018 IEEE International Symposium on Information Theory (ISIT)  
We consider interactive computation of randomized functions between two users with the following privacy requirement: the interactive communication should not reveal to either user any extra information  ...  Then we discuss the role of common randomness and interaction in both privacy settings.  ...  This work was done while Jithin Ravi was at Tata Institute of Fundamental Research. He has received funding from ERC grant 714161.  ... 
doi:10.1109/isit.2018.8437855 dblp:conf/isit/KurriPR18 fatcat:hom4vm4rrjgidhkweiatxcympi
« Previous Showing results 1 — 15 out of 354,323 results