Filters








13,526 Hits in 3.2 sec

Adaptively secure broadcast, revisited

Juan A. Garay, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou
2011 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11  
We also study the impact of adaptive attacks on protocols for secure multi-party computation where broadcast is used as a sub-routine.  ...  We revisit the problem of adaptively secure broadcast in a more natural synchronous model (with rushing), and show that broadcast is possible in this setting for an arbitrary number of corruptions.  ...  Section 3 defines various notions of broadcast, and contains our construction of adaptively secure broadcast. We discuss the consequences for adaptively secure multi-party computation in Section 4.  ... 
doi:10.1145/1993806.1993832 dblp:conf/podc/GarayKKZ11 fatcat:hktocdcpnffcvpujstnbg75sl4

Adaptively Secure Coin-Flipping, Revisited [article]

Shafi Goldwasser, Yael Tauman Kalai, Sunoo Park
2015 arXiv   pre-print
We prove that any one-round coin-flipping protocol, regardless of message length, is secure against at most $\tilde{O}(\sqrt n)$ strong adaptive corruptions.  ...  At the heart of our results lies a novel use of the Minimax Theorem and a new technique for converting any one-round secure protocol into a protocol with messages of $polylog(n)$ bits.  ...  We believe that the notion of strong adaptive security gives rise to a natural and interesting new adversarial model in which to study multi-party protocols in general.  ... 
arXiv:1503.01588v2 fatcat:6fj7ze4kczffljicema2sngmoa

Public-Key Cryptography (Dagstuhl Seminar 16371)

Marc Fischlin, Alexander May, David Pointcheval, Tal Rabin, Marc Herbstritt
2017 Dagstuhl Reports  
This report documents the program and results of Dagstuhl seminar 16731 "Public-Key Cryptography" which took place September 11-16, 2016.  ...  The goal of the seminar was to bring together different subareas from public-key cryptography and to promote research among these areas.  ...  Haitner, Levi Nissan, Eliad Tsfadia In a multi-party fair coin-flipping protocol, the parties output a common (close to) unbiased bit, even when some corrupted parties try to bias the output.  ... 
doi:10.4230/dagrep.6.9.46 dblp:journals/dagstuhl-reports/Fischlin0PR16 fatcat:figv27hq4feibl5nzb7snrtm2i

Adaptively Secure Coin-Flipping, Revisited [chapter]

Shafi Goldwasser, Yael Tauman Kalai, Sunoo Park
2015 Lecture Notes in Computer Science  
We prove that any one-round coin-flipping protocol, regardless of message length, can be secure against at most O( √ n) strong adaptive corruptions.  ...  is a symmetric one-round coin-flipping protocol secure against t strongly adaptive corruptions.  ...  We believe that the notion of strong adaptive security gives rise to a natural and interesting new adversarial model in which to study multi-party protocols in general.  ... 
doi:10.1007/978-3-662-47666-6_53 fatcat:yjsf37wkrvh2zgcgyjinezes4i

Separating Standard and Asymmetric Password-Authenticated Key Exchange [article]

Julia Hesse
2019 IACR Cryptology ePrint Archive  
We showcase how our revisited security notion for 2-party asymmetric PAKE can be used to obtain asymmetric PAKE protocols in the multi-user setting and discuss important aspects for implementing such a  ...  To our knowledge, this is the first formal security proof of the Ω-method in the literature. • Composable multi-party asymmetric PAKE.  ...  Discussion with Victor on how to resolve issues with session identifiers for the multi-user setting were particularly instructing.  ... 
dblp:journals/iacr/Hesse19 fatcat:zbxpemxuirhm7gldoyfjvywp2i

Adapting Workflows Using Generic Schemas: Application to the Security of Business Processes

Ronan-Alexandre Cherrueau, Mario Sudholt, Omar Chebaro
2013 2013 IEEE 5th International Conference on Cloud Computing Technology and Science  
First, we introduce workflow adaptation schemas (WAS), a new notion of generic protocol-based workflow adapters.  ...  As we motivate, these security issues require historybased adaptations over different abstraction levels of services. We then show how to resolve these issues using WAS.  ...  MOTIVATION We have investigated modifications of workflows in the context of securing multi-party and cross-organizational business processes.  ... 
doi:10.1109/cloudcom.2013.75 dblp:conf/cloudcom/CherrueauSC13 fatcat:me5xssjkordvthqp3xqldugz4y

Guest editorial: Information security methodology and replication studies

Steffen Wendzel, Luca Caviglione, Aleksandra Mileva, Jean-Francois Lalande, Wojciech Mazurczyk
2022 it - Information Technology  
This special issue presents five articles that address the topic of replicability and scientific methodology in information security research, featuring two extended articles from the 2021 International  ...  Workshop on Information Security Methodology and Replication Studies (IWSMR).  ...  Finally, the work from Daniel Demmler shows how real-world applications of secure multi-party computation and private information retrieval can be executed in an efficient manner with realistic input sizes  ... 
doi:10.1515/itit-2022-0016 fatcat:nwyl4ksa6zdypipzgses3t55su

Efficient Password Authenticated Key Exchange via Oblivious Transfer [chapter]

Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee
2012 Lecture Notes in Computer Science  
Second, modifying the schemes based on smooth projective hashing to achieve security against adaptive corruptions (where an adversary may choose which parties to corrupt during the execution of the protocol  ...  Using this framework, we obtain: an efficient and simple UC-secure PAKE protocol that is secure against adaptive corruptions without erasures. efficient and simple PAKE protocols under the Computational  ...  Let A be an adaptive adversary interacting with a pair of parties I and R running the protocol Π REfromOT .  ... 
doi:10.1007/978-3-642-30057-8_27 fatcat:s7djr2lmenflxbmhdg2hejbmoi

Limits of Practical Sublinear Secure Computation [chapter]

Elette Boyle, Yuval Ishai, Antigoni Polychroniadou
2018 Lecture Notes in Computer Science  
This imposes a barrier on the local computational cost of secure protocols for the problem.  ...  secure computation on big data, there are practical sublinear communication protocols that only require sublinear local computation and minimize the use of expensive public-key operations.  ...  The median two-party and multi-party protocols of [AMP10] are in the two-sided model, where both parties receive an output.  ... 
doi:10.1007/978-3-319-96878-0_11 fatcat:cl4qdq44sjffjjrthcnwpuyat4

Multi-Designated Verifiers Signatures Revisited

Sherman S. M. Chow
2008 International Journal of Network Security  
We propose two new generic constructions of MDVS from variants of existing cryptographic schemes, which are ring signature from anonymous subset and multi-chameleon hash.  ...  Multi-Designated Verifier Signatures (MDVS) are privacy-oriented signatures that can only be verified by a set of users specified by the signer.  ...  says by invoking a secure multi-party computation protocol).  ... 
dblp:journals/ijnsec/Chow08 fatcat:kdhnqwmy7bdetmiehp2ubx5ieq

Revisiting Optimistic Fair Exchange Based on Ring Signatures

Yang Wang, Man Ho Allen Au, Willy Susilo
2014 IEEE Transactions on Information Forensics and Security  
Optimistic fair exchange (OFE) is a kind of protocol that solves the fair exchange problem with the help of a trusted third party, usually referred to as an arbitrator.  ...  Based on this two-party ring signature, we construct an OFE secure in the chosen-key model offering multi-user security in the standard model under the Computational Diffie-Hellman assumption.  ...  An optimistic fair exchange protocol comprises signers, verifiers, and a trusted third party named "arbitrator".  ... 
doi:10.1109/tifs.2014.2354986 fatcat:blas76uwb5hs3ar5kzlmdwz3hi

PRIVACY PRESERVATION MECHANISM USING CLUSTERING TECHNIQUES ON HADOOP

Dhanuja A.R
2020 International Journal of Engineering Applied Sciences and Technology  
Exploratory evaluation of a data set of 5 million items further supports the useful execution of the plan.  ...  A thorough safety investigation and numerical examination complete the presentation of the plan regarding safety and competition.  ...  The way, these multi-party structures are not viable for protection by safeguarding the reappropriation of the grouping.  ... 
doi:10.33564/ijeast.2020.v05i04.049 fatcat:eu25fyvmfvhshfrvcmfdqq6hnu

Secure Stable Matching at Scale

Jack Doerner, David Evans, abhi shelat
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
Secure multi-party computation offers the possibility of private matching processes that do not rely on any common trusted third party.  ...  However, stable matching algorithms have previously been considered infeasible for execution in a secure multi-party context on non-trivial inputs because they are computationally intensive and involve  ...  This work was partially supported by grants from the National Science Foundation SaTC program (NSF Award CNS-1111781), the Air Force Office of Scientific Research, and Google.  ... 
doi:10.1145/2976749.2978373 dblp:conf/ccs/DoernerES16 fatcat:4wgv35kgwrhg5ob6ognyarchf4

A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs

Keitaro Hashimoto, Shuichi Katsumata, Eamonn Postlethwaite, Thomas Prest, Bas Westerbaan
2021 Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security  
Continuous group key agreements (CGKAs) are a class of protocols that can provide strong security guarantees to secure group messaging protocols such as Signal and MLS.  ...  Our protocol relies on generic primitives, and is therefore readily post-quantum.  ...  Secure messaging in the simpler two-party setting has also been an active area of research, motivated by the Signal protocol.  ... 
doi:10.1145/3460120.3484817 fatcat:cs2vbx7ounf4bodxhifag3wzta

Improved Non-committing Encryption with Applications to Adaptively Secure Protocols [chapter]

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee
2009 Lecture Notes in Computer Science  
Combined with existing work on secure multi-party computation, we obtain protocols for multi-party computation secure against a malicious adversary that may adaptively corrupt an arbitrary number of parties  ...  Specifically, we obtain the first adaptively secure multi-party protocols based on hardness of factoring in both the stand-alone setting and the UC setting with a common reference string.  ...  Specifically, we obtain the first adaptively secure multi-party protocols based on hardness of factoring in both the stand-alone setting and the UC setting with a common reference string.  ... 
doi:10.1007/978-3-642-10366-7_17 fatcat:pte5no75lre7fggv6wnowbncvu
« Previous Showing results 1 — 15 out of 13,526 results