361 Hits in 4.0 sec

A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security [chapter]

Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek
2010 Lecture Notes in Computer Science  
What other trusted setups allow UC-secure protocols for all tasks? More generally, given a particular setup, what tasks have UC-secure protocols?  ...  We prove this zero-one law under a natural intractability assumption, and consider the class of deterministic, finite, 2-party functionalities as candidate trusted setups.  ...  Acknowledgments We acknowledge helpful discussions with Ran Canetti, Yuval Ishai, Yehuda Lindell and Amit Sahai, as well as helpful suggestions from anonymous conference referees.  ... 
doi:10.1007/978-3-642-14623-7_32 fatcat:3dumwbxy25dond3sfqfevcbvoq

Feasibility and Completeness of Cryptographic Tasks in the Quantum World [chapter]

Serge Fehr, Jonathan Katz, Fang Song, Hong-Sheng Zhou, Vassilis Zikas
2013 Lecture Notes in Computer Science  
With respect to computational security, we show that existing feasibility results carry over unchanged from the classical to the quantum world; a functionality is "trivial" (i.e., can be realized without  ...  With this in mind, we study the feasibility of realizing functionalities in the framework of universal composability, with respect to both computational and informationtheoretic security.  ...  A zero-one law for cryptographic com- plexity with respect to computational UC security. In Advances in Cryptology -Crypto 2010, volume 6223 of LNCS, pages 595-612. Springer, 2010.  ... 
doi:10.1007/978-3-642-36594-2_16 fatcat:iycjx6b5lzabzhgukkdpepxvxq

HERMES: Scalable, Secure, and Privacy-Enhancing Vehicle Access System [article]

Iraklis Symeonidis, Dragos Rotaru, Mustafa A. Mustafa, Bart Mennink, Bart Preneel, Panos Papadimitratos
2021 arXiv   pre-print
To cater to system and user needs for secure and private computations, HERMES utilizes and combines several cryptographic primitives with secure multiparty computation efficiently.  ...  We propose HERMES, a scalable, secure, and privacy-enhancing system for users to share and access vehicles.  ...  Note that since we are using a different key than the first step we need to compute another tweak (one extra PRF call), • 6 calls to compute AuthT ag BD uo ,uc , one more PRF call for computing the tweak  ... 
arXiv:2101.01950v2 fatcat:fxx7lc6rbvcp7epxr6gl5l7vka

Efficient Privacy-Preserving Data Mining in Malicious Model [chapter]

Keita Emura, Atsuko Miyaji, Mohammad Shahriar Rahman
2010 Lecture Notes in Computer Science  
With this in mind, Kantarcioglu et al. proposed secure dot product and secure setintersection protocols for privacy-preserving data mining in malicious adversarial model using zero knowledge proofs, since  ...  In our work, the complexity of computation and communication for proof of knowledge is always constant (independent of the number of data items), while the complexity of computation and communication for  ...  A detailed discussion on the UC framework can be found in [3] .  ... 
doi:10.1007/978-3-642-17316-5_36 fatcat:voalkktbvnfwvjzfqy63qix3ai

Symbolic Universal Composability

Florian Bohl, Dominique Unruh
2013 2013 IEEE 26th Computer Security Foundations Symposium  
We furthermore introduce a new technique for modular design of protocols that uses UC but avoids the need for powerful cryptographic primitives that often comes with UC protocols; this "virtual primitives  ...  " approach is unique to the symbolic setting and has no counterpart in the original computational UC framework.  ...  Show that P emulates F with respect to M virt . • Compose P with other protocols, leading to a complex protocol C[P ] ≤ C[F] ≤ G (with respect to M virt ) where G is some desired final goal, e.g., some  ... 
doi:10.1109/csf.2013.24 dblp:conf/csfw/BohlU13 fatcat:ytspbagcebg5vaukffuk4fc664

Long-Term Security and Universal Composability

Jörn Müller-Quade, Dominique Unruh
2010 Journal of Cryptology  
We show that the usual set-up assumptions used for UC protocols (e.g., a common reference string) are not sufficient to achieve long-term secure and composable protocols for commitments or general zero  ...  Surprisingly, nontrivial zero knowledge protocols are possible based on a coin tossing functionality: We give a long-term secure composable zero knowledge protocol proving the knowledge of the factorisation  ...  We thank the anonymous referees for many helpful suggestions.  ... 
doi:10.1007/s00145-010-9068-8 fatcat:loydtankxbgatpfhhpr3zykj54

Privacy-Preserving Data Mining in Presence of Covert Adversaries [chapter]

Atsuko Miyaji, Mohammad Shahriar Rahman
2010 Lecture Notes in Computer Science  
While semi-honest model provides weak security requiring small amount of computation and malicious model provides strong security requiring expensive computations like Non-Interactive Zero Knowledge proofs  ...  , respectively.  ...  Cryptographic Primitives Security Model: Universal Composability (UC) Security in the UC framework implies that any adversary in the real-life model can be emulated by an adversary in the ideal model  ... 
doi:10.1007/978-3-642-17316-5_41 fatcat:6unizehclbgvddh2jz37xp2c2i

Composability in quantum cryptography

Jörn Müller-Quade, Renato Renner
2009 New Journal of Physics  
We discuss the security criteria that a quantum key distribution protocol must fulfill to allow its safe use within a larger security application (e.g., for secure message transmission).  ...  In a second part, we take a more general point of view, which is necessary for the study of cryptographic situations involving, for example, mutually distrustful parties.  ...  Acknowledgment We would like to thank Gilles Brassard for helpful comments on an earlier version of the manuscript.  ... 
doi:10.1088/1367-2630/11/8/085006 fatcat:e6kru2akfvfcfizvssztyyayky

High performance logistic regression for privacy-preserving genome analysis

Martine De Cock, Rafael Dowsley, Anderson C. A. Nascimento, Davis Railsback, Jianwei Shen, Ariel Todoki
2021 BMC Medical Genomics  
To the best of our knowledge, we present the fastest existing secure multi-party computation implementation for training logistic regression models on high dimensional genome data distributed across a  ...  Conclusions In this paper, we present a secure logistic regression training protocol and its implementation, with a new subprotocol to securely compute the activation function.  ...  MDC proposed the use of LR and derived the gradient descent algorithm for minimizing the sum of squared errors with a neuron with a clipped ReLu activation function.  ... 
doi:10.1186/s12920-020-00869-9 pmid:33472626 fatcat:fitswbgp7rgrxjusjzn6tz3wmm

How to Construct Rational Protocols with Nash Equilibrium Consistency in the UC framework [article]

Xiaoxia Jiang, Youliang Tian
2019 IACR Cryptology ePrint Archive  
In a word, the proposed rational delegated computing protocol πRDC based on incentive-driven adversary has been proven to be secure in the universally composable framework, furthermore, we effectively  ...  The inconsistency of Nash equilibrium of rational delegated computation scheme in the UC framework will lead to the lack of strict security proof of the protocols fundamentally.  ...  Besides, we design a secure protocol π RDC for rational delegated computation based on the incentive-driven adversary.  ... 
dblp:journals/iacr/JiangT19 fatcat:q7lp5w76infxhjqt3xk5xylj5u

Abuse Resistant Law Enforcement Access Systems [article]

Matthew Green, Gabriel Kaptchuk, Gijs Van Laer
2021 IACR Cryptology ePrint Archive  
The increasing deployment of end-to-end encrypted communications services has ignited a debate between technology firms and law enforcement agencies over the need for lawful access to encrypted communications  ...  We first define a set of desirable properties for an abuse-resistant law enforcement access system (ARLEAS), and motivate each of these properties.  ...  To do this, we provide a new cryptographic definition for an abuse resistant law enforcement access system.  ... 
dblp:journals/iacr/0001KL21 fatcat:v3qmqaq3krbrpoohetrxsb2r7q

Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation [chapter]

Martin Hirt, Jesper Buus Nielsen
2005 Lecture Notes in Computer Science  
We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model.  ...  Furthermore, we improve the upper bound on the communication complexity of passive secure multiparty computation with resilience t < n from O(cn 2 κ) to O(cnκ).  ...  Acknowledgments We would like to thank Ivan Damgård, Serge Fehr and Matthias Fitzi for many fruitful discussions, and the anonymous referees for their helpful comments.  ... 
doi:10.1007/11593447_5 fatcat:gxihtxac7zbtpfzxied5eayc7y

High Performance Logistic Regression for Privacy-Preserving Genome Analysis [article]

Martine De Cock and Rafael Dowsley and Anderson C. A. Nascimento and Davis Railsback and Jianwei Shen and Ariel Todoki
2020 arXiv   pre-print
In this paper, we present a secure logistic regression training protocol and its implementation, with a new subprotocol to securely compute the activation function.  ...  To the best of our knowledge, we present the fastest existing secure Multi-Party Computation implementation for training logistic regression models on high dimensional genome data distributed across a  ...  ACKNOWLEDGEMENTS The authors want to thank P. Mohassel for making the SecureML code available that was used for the experimental comparison in the Section Results.  ... 
arXiv:2002.05377v2 fatcat:r5li6wxrxjhpdbhvxwqyfshmcm

Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications [chapter]

Frédéric Dupuis, Serge Fehr, Philippe Lamontagne, Louis Salvail
2016 Lecture Notes in Computer Science  
We demonstrate the usefulness of this methodology with two examples. The first is a quantum bit commitment scheme based on 1-bit cut-and-choose.  ...  Since adaptivity is notoriously difficult to handle in the analysis of (quantum) cryptographic protocols, this gives us a very powerful tool: as long as we have enough control over the side information  ...  Theorem 8. 1CC is statistically quantum UC-complete. Proof. We have shown that ot 1CC statistically quantum-UC-emulates OT.  ... 
doi:10.1007/978-3-662-53015-3_2 fatcat:ah7otaemjvehfg7piuwcmgpwxm

SoK: Cryptographic Confidentiality of Data on Mobile Devices

Maximilian Zinkus, Tushar M. Jois, Matthew Green
2021 Proceedings on Privacy Enhancing Technologies  
We evaluate the existing literature for securing devices against data extraction adversaries with powerful capabilities including access to devices and to the cloud services they rely on.  ...  Our work proposes a methodology that researchers can use to analyze cryptographic data confidentiality for mobile devices.  ...  Acknowledgments The authors would like to thank Dr. Mike Rushanan, and Emma Weil and Dr. Harlan Yu of Upturn, for their insightful feedback.  ... 
doi:10.2478/popets-2022-0029 fatcat:uykbhajxxveatal5jopghi2jji
« Previous Showing results 1 — 15 out of 361 results