Filters








434,877 Hits in 4.1 sec

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

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.  ...  Interestingly, characterization for securely computable randomized functions is still not known.  ... 
arXiv:1705.07081v1 fatcat:zuxpilcqk5e3bni2gs3b6bfrty

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

Steven Myers
2001 Lecture Notes in Computer Science  
G and ri are strings of random bits.  ...  We show that given a PRFG (pseudo-random function generator) G which is 1 c -partially secure, the construction g1(x ⊕ r1) ⊕ · · · ⊕ g log 2 n (x⊕r log 2 n ) produces a strongly secure PRFG, where gi ∈  ...  Note that in order to compute a random function f n ∈ F it is sufficient to compute g 1 (x ⊕ r 1 ) ⊕ · · · g p(n) (x ⊕ r n ) , where g i ∈ G and r i ∈ {0, 1} n .  ... 
doi:10.1007/3-540-44987-6_22 fatcat:a4pzvmdbfbb5vmldfnfu23cdpm

On Randomizing Hash Functions to Strengthen the Security of Digital Signatures [chapter]

Praveen Gauravaram, Lars R. Knudsen
2009 Lecture Notes in Computer Science  
collision resistance property of the hash functions.  ...  a t-bit RMX-hash function which uses the Davies-Meyer compression functions (e.g., MD4, MD5, SHA family) in 2 t/2 chosen messages plus 2 t/2+1 off-line operations of the compression function and similar  ...  Many thanks Quynh Dang and Ray Perlner for valuable discussions on this research and to Chris Mitchell for bringing to our awareness some important early works [14, 13, 1] on randomized hashing to strengthen  ... 
doi:10.1007/978-3-642-01001-9_5 fatcat:ocynlygo2bbehcpjizps75ofty

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  ...  They inherit their unclonability from the fact that they consist of many random components that are present in the manufacturing process and cannot be controlled.  ...  (independent) CRPs However, for many crypto apps, the aim is for computational rather than perfect measures of security PUF Open Questions Therefore, even if the true entropy content is limited there  ... 
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  ...  They inherit their unclonability from the fact that they consist of many random components that are present in the manufacturing process and cannot be controlled.  ...  (independent) CRPs However, for many crypto apps, the aim is for computational rather than perfect measures of security PUF Open Questions Therefore, even if the true entropy content is limited there  ... 
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.  ...  Many random functions, like Hash, MAC, PRG, have been used in various network applications for different security choices, however they either are fast but insecure, or are cryptographic secure but slow  ...  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

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

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

G.E. Suh, C.W. O'Donnell, I. Sachdev, S. Devadas
32nd International Symposium on Computer Architecture (ISCA'05)  
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.1109/isca.2005.22 dblp:conf/isca/SuhOSD05 fatcat:xhedgrinvndhjfa4ejbgjzx35e

A Quantitative Approach to Reductions in Secure Computation [chapter]

Amos Beimel, Tal Malkin
2004 Lecture Notes in Computer Science  
Secure computation is one of the most fundamental cryptographic tasks.  ...  This approach leads to a better understanding of the inherent complexity for securely computing a given function f .  ...  We thank Yuval Ishai for helpful discussions and Enav Weinreb for helpful remarks on earlier versions of this paper.  ... 
doi:10.1007/978-3-540-24638-1_14 fatcat:khnh525o6vhrzfyg5nkceqg4fe

Cryptography and Algorithmic Randomness [article]

Kohtaro Tadaki, Norihisa Doi
2013 arXiv   pre-print
The main result of this paper is to show that, for any secure signature scheme in the random oracle model, there exists a specific computable function which can instantiate the random oracle while keeping  ...  In the random oracle model, the cryptographic hash function used in a cryptographic scheme is formulated as a random variable uniformly distributed over all possibility of the function, called the random  ...  Acknowledgments This work was supported by JSPS KAKENHI Grant Number 23340020 and by the Ministry of Economy, Trade and Industry of Japan.  ... 
arXiv:1305.2391v1 fatcat:etmw4pbhwnaivivd4yntzqgi6u

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 investigate the extent to which correlated secret randomness can help in secure computation with no honest majority.  ...  Any multiparty functionality can be realized, with perfect security against semi-honest parties or statistical security against malicious parties, by a protocol in which the number of bits communicated  ...  This, together with the fact that OT is complete for secure computation [24, 22] , shows that every functionality can be securely computed given access to an appropriate source of correlated randomness  ... 
doi:10.1007/978-3-642-36594-2_34 fatcat:qotanshyobbvrmp4ihyoiacbxe

Inherit Differential Privacy in Distributed Setting: Multiparty Randomized Function Computation [article]

Genqiang Wu and Yeping He and Jingzheng Wu and Xianyao Xia
2016 arXiv   pre-print
We consider in what condition can a protocol inherit the differential privacy property of a function it computes. The heart of the problem is the secure multiparty computation of randomized function.  ...  We also provide a complexity bound of computing randomized function in the distribute setting.  ...  The Security of Computing Randomized Function In the section, we study the security of computing randomized function in the distributed setting.  ... 
arXiv:1604.03001v1 fatcat:jg6piqufj5e2zendmvbqy5oase

An Efficient Approach for Privacy Preserving Data Mining using SMC Techniques and Related Algorithms

P. Annan Naidu
2018 International Journal for Research in Applied Science and Engineering Technology  
computations for privacy preserving data mining and also states that different approaches to achieve secure multiparty computations, in this process SMC deals with secret sharing of data among different  ...  When data extracted from different data sources for business decisions or for business processing, It is mandatory to secure the data of individuals or group and providing privacy of data.  ...  knowledge of data by partial derivatives of functional values. 2) Secure computation of key by the Eigen value of Jacobian matrix which satisfies the implicit function theorem.  ... 
doi:10.22214/ijraset.2018.4292 fatcat:s2o4bqevxvhgbiuxdkfon7czqm

Securely Computing the Three-Input Majority Function with Eight Cards [chapter]

Takuya Nishida, Takaaki Mizuki, Hideaki Sone
2013 Lecture Notes in Computer Science  
As shown below, our secure majority computation, which is a kind of cryptographic task, relies on simple properties of physical cards; we do not need a conventional computer or communication network system  ...  In this paper, we show that such a secure majority computation can be done with a deck of real cards; specifically, the three players can learn only the majority of their inputs using eight physical cards-four  ...  Consequently, it is well known that any function can be securely computed using some number of cards.  ... 
doi:10.1007/978-3-642-45008-2_16 fatcat:mzed3irgvbafxdbiajzxnep2ei
« Previous Showing results 1 — 15 out of 434,877 results