16,948 Hits in 4.6 sec

Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data [chapter]

Shashank Agrawal, Shweta Agrawal, Manoj Prabhakaran
2015 Lecture Notes in Computer Science  
IND-PRE-security is parameterized by the choice of the "test" family, such that by choosing different test families, one can obtain different levels of security for the same primitive (including various  ...  provide a new framework of cryptographic agents that unifies various modern "cryptographic objects" -identity-based encryption, fully-homomorphic encryption, functional encryption, and various forms of obfuscation  ...  obfuscation (aftersome modifications) can be based on semantically secure multi-linear groups [4] .  ... 
doi:10.1007/978-3-662-46803-6_17 fatcat:jzsadxqa2feznkhgfaj3kyo6ny

From Obfuscation to the Security of Fiat-Shamir for Proofs [chapter]

Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum
2017 Lecture Notes in Computer Science  
obfuscator, the existence of an exponentially secure input-hiding obfuscator for the class of multi-bit point functions, and the existence of a sub-exponentially secure one-way function. * Microsoft Research  ...  The Fiat-Shamir method is extremely simple and intuitive: The basic idea is to reduce interaction by having the verifier send the prover a hash function H (chosen at random from some family of hash functions  ...  It was proved in [BC14] that this construction is secure in the the generic group model, where the inversion probability is at most poly(n) · 2 −n .  ... 
doi:10.1007/978-3-319-63715-0_8 fatcat:hgganz4bzvd6tfbs34ibw6oip4

Anonymous Identification for Ad Hoc Group

Xingye Lu, Man Ho Au
2016 Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security - ASIA CCS '16  
We propose a highly efficient construction of this cryptographic primitive in the symmetric key setting based on the idea of program obfuscation.  ...  To analyse the security of our proposal, we develop a security model to capture the security requirements of this primitive and prove that our construction satisfies these requirements in the random oracle  ...  Before this, none of the proposed program obfuscation schemes had proven its security properties.  ... 
doi:10.1145/2897845.2897903 dblp:conf/ccs/LuA16 fatcat:yivesmaa75hehacahfqinaqvua

A Simple Obfuscation Scheme for Pattern-Matching with Wildcards [chapter]

Allison Bishop, Lucas Kowalczyk, Tal Malkin, Valerio Pastro, Mariana Raykova, Kevin Shi
2018 Lecture Notes in Computer Science  
We give a simple and efficient method for obfuscating pattern matching with wildcards.  ...  We rely upon the generic group heuristic (in a regular group, with no multilinearity). Previous work [BR13, BVWW16, WZ17] provided less efficient constructions based on multilinear maps or LWE.  ...  The security proof shows that the obfuscation scheme constructed for a specific pattern matching with wildcards function f y,W is indistinguishable from an obfuscation where all h ij are random group elements  ... 
doi:10.1007/978-3-319-96878-0_25 fatcat:tczme4ininaj7bqgovnbsbxo2i

How to Avoid Obfuscation Using Witness PRFs [chapter]

Mark Zhandry
2015 Lecture Notes in Computer Science  
Current candidate obfuscators are far from practical and typically rely on unnatural hardness assumptions about multilinear maps.  ...  We give a construction of witness PRFs from multilinear maps that is simpler and much more efficient than current obfuscation candidates, thus bringing several applications of obfuscation closer to practice  ...  for one element from each group.  ... 
doi:10.1007/978-3-662-49099-0_16 fatcat:axsywzqmjngujl7gplqn2chfs4

Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation [chapter]

Ilan Komargodski, Eylon Yogev
2018 Lecture Notes in Computer Science  
that the adversary outputs is verifiable, that is, it looks like an obfuscation of the value f (x) (i.e., it comes from the "same family" of circuits).  ...  The security of our construction relies on variants of the DDH and power-DDH assumptions.  ...  It is possible to view our obfuscator as a non-interactive non-malleable commitment that is secure when committing to strings that come from a distribution with super-logarithmic entropy.  ... 
doi:10.1007/978-3-319-78381-9_10 fatcat:b55yqbrcc5f2tpgilkfzemcfpq

A Secure Obfuscator for Encrypted Blind Signature Functionality [chapter]

Xiao Feng, Zheng Yuan
2014 Lecture Notes in Computer Science  
They obfuscated re-encryption and proved the security of obfuscator in the standard model.  ...  Furthermore, Bob doesn't want anyone to know the interactive process.  ...  The blindness of EBS obfuscator follows directly from the hardness of DL assumption in the group G.  ... 
doi:10.1007/978-3-319-11698-3_24 fatcat:tj2xafubrzh6bgrdogpydgrj64

Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation [chapter]

Dakshita Khurana, Vanishree Rao, Amit Sahai
2015 Lecture Notes in Computer Science  
We construct the first non-interactive key exchange protocols which support an unbounded number of parties and have a security proof that does not rely on knowledge assumptions.  ...  Our non-interactive key-exchange protocol does not require a trusted setup and extends easily to the identity-based setting.  ...  Introduction Non-interactive key exchange (NIKE) enables a group of parties to derive a shared secret key without any interaction.  ... 
doi:10.1007/978-3-662-48797-6_3 fatcat:c2mspqrdkbguzmblirnaz7lmvy

Obfuscated databases and group privacy

Arvind Narayanan, Vitaly Shmatikov
2005 Proceedings of the 12th ACM conference on Computer and communications security - CCS '05  
We start with a simple form of database obfuscation which makes database records indistinguishable from lookup functions.  ...  Our constructions are non-interactive.  ...  While our constructions for group privacy are provably secure in the "virtual black-box" sense of [2] , the cost of this rigorous security is a quadratic blowup in the size of the obfuscated database,  ... 
doi:10.1145/1102120.1102135 dblp:conf/ccs/NarayananS05 fatcat:q77pcxown5efxbdxscwikl7g5q

Obfuscating Simple Functionalities from Knowledge assumptions

Ward Beullens, Hoeteck Wee
2019 Zenodo  
This paper shows how to obfuscate several simple functionalities from a new Knowledge of OrthogonALity Assumption (KOALA) in cyclic groups which is shown to hold in the Generic Group Model.  ...  Specifically, we give simpler and stronger security proofs for obfuscation schemes for point functions, general-output point functions and pattern matching with wildcards.  ...  Theorem 2 (Obfuscating point functions from KOALA). The point func- tion obfuscator from [7] using a sequence of groups {G n } n∈N that satisfies KOALA is VBB secure.  ... 
doi:10.5281/zenodo.3405951 fatcat:fwqxvhzfqfhubi2om7sizmsj4u

A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation [chapter]

Matthew D. Green, Jonathan Katz, Alex J. Malozemoff, Hong-Sheng Zhou
2016 Lecture Notes in Computer Science  
In this work we refute this possibility, assuming the existence of indistinguishability obfuscation. We do so in the following way.  ...  However, all known separation results require the attacker to send an appropriately crafted message to the challenger in order to break security.  ...  Two groups of researchers concurrently looked at the problem of differing-inputs obfuscation [1, 9] ; however, Garg et al.  ... 
doi:10.1007/978-3-319-44618-9_31 fatcat:4hh3ho73hnfb7gyjmc4fbgjye4

A privacy-preserving interdomain audit framework

Adam J. Lee, Parisa Tabriz, Nikita Borisov
2006 Proceedings of the 5th ACM workshop on Privacy in electronic society - WPES '06  
Unfortunately, when it comes to the security analysis of these systems, the whole is certainly greater than the sum of its parts.  ...  A distributed process that coordinates information from each member could detect these types of violations, but privacy concerns between member organizations or safety concerns about centralizing sensitive  ...  At an opposite extreme from systems that prepare data for public disclosure lies the secure multi-party computation problem.  ... 
doi:10.1145/1179601.1179620 dblp:conf/wpes/LeeTB06 fatcat:jhde4ykqkbgq7pzlj6uxpbcbq4

Public-key encryption with keyword search via obfuscation

Chengyu Hu, Pengtao Liu, Rupeng Yang, Yan Xu
2019 IEEE Access  
In this paper, we focus on how to construct a PEKS scheme via obfuscation.  ...  Our basic scheme is built on the differing-inputs obfuscation (diO) and can be considered as an initial attempt to apply diO in the PEKS field.  ...  Thus from the security of differing-inputs obfuscator, diO(P search ) and diO(P search ) are computationally indistinguishable. Therefore, Game 1 is indistinguishable from Game 0 .  ... 
doi:10.1109/access.2019.2905250 fatcat:ptwhfwvgbfduzo2ktdjzm4gcve

On Concurrently Secure Computation in the Multiple Ideal Query Model [chapter]

Vipul Goyal, Abhishek Jain
2013 Lecture Notes in Computer Science  
Interestingly, our compiler uses ideas from the work on obfuscation using tamper-proof hardware, even though our setting does not involve any hardware.  ...  The importance of the above question stems from the fact that if the answer is positive, then it would enable meaningful security guarantees in many application scenarios, as well as, lead to resolution  ...  Introduced in the seminal works of [43, 18] , secure multi-party computation allows a group of (mutually) distrustful parties P 1 , . . . , P n , with private inputs x 1 , . . . , x n , to jointly compute  ... 
doi:10.1007/978-3-642-38348-9_40 fatcat:jpws2xlss5euhao7vceplqqs6y

Enhanced Obfuscation Technique for Data Confidentiality in Public Cloud Storage

S. Arul Oli, L. Arockiam, G.A. Chang, M. Ma, S. Arumuga Perumal, G. Chen
2016 MATEC Web of Conferences  
The Obfuscation techniques come to rescue for protecting data from malicious attacks.  ...  This paper proposes an obfuscation technique to encrypt the desired data type on the cloud providing more protection from unknown hackers.  ...  From the above experimental results it is evident that security level is high in the proposed obfuscation technique.  ... 
doi:10.1051/matecconf/20164009003 fatcat:5sl5u3i5trhgrcvctl6kvvlguu
« Previous Showing results 1 — 15 out of 16,948 results