A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
On the Communication Complexity of Secure Computation
[article]
2014
arXiv
pre-print
Preserved Fulltext
Other Versions
Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity of this primitive. ...
In this work, we develop powerful information theoretic tools to prove lower bounds on the communication complexity of MPC. ...
[FL82, GIKR01, FGG + 06, PCRR09, KKK09]), In the computational security setting, [NN01] gave upper bounds on the communication complexity of 2-party secure computation in terms of the communication complexity ...
arXiv:1311.7584v2
fatcat:ksgnrmbq7zeu3ndj5v63bshcma
On the Communication Complexity of Secure Computation
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity of this primitive. ...
In this work, we develop powerful information theoretic tools to prove lower bounds on the communication complexity of MPC. ...
Among other things, these results upper-bounded the communication complexity of multi-party secure computation in terms of the circuit complexity of the computation. ...
doi:10.1007/978-3-662-44381-1_12
fatcat:zr2xvjjqcvepdmndfnpx4bmrsu
Communication complexity of group key distribution
1998
Proceedings of the 5th ACM conference on Computer and communications security - CCS '98
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Communication complexity has al~vays been an important issue Ivhen designing group key distribution systems. ...
This paper systematically studies \vhat can be achieved for the most common measures of protocol complexity. ...
To copy othenvise. to republish, to post on sen,ers or to redistribute to lists, requires prior sQeciticpermission and{ora fee. 5th Conference on Computer& Communications Security San Francisco CA USA ...
doi:10.1145/288090.288094
dblp:conf/ccs/BeckerW98
fatcat:yth6h7rvk5ftzaqhpaeteymatq
On the practical importance of communication complexity for secure multi-party computation protocols
2009
Proceedings of the 2009 ACM symposium on Applied Computing - SAC '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. ...
of the network performance. ...
This seems logical as the communication complexity is the lower bound of the computation complexity. ...
doi:10.1145/1529282.1529730
dblp:conf/sac/KerschbaumDSB09
fatcat:ctuitteornajldfzlzcqtyslnq
Optimal Average-Complexity Ideal-Security Order-Preserving Encryption
2014
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that our scheme improves the average communication complexity from O(n log n) to O(n) under uniform distribution. ...
Our scheme is inspired by Reed's referenced work on the average height of random binary search trees. ...
Previously, interactive techniques such as secure computation [40, 41] have been used. ...
doi:10.1145/2660267.2660277
dblp:conf/ccs/KerschbaumS14
fatcat:tkdbv7tcmfgnlasrobs76sx7ke
On the parameterized complexity of the workflow satisfiability problem
2012
Proceedings of the 2012 ACM conference on Computer and communications security - CCS '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Security requirements may impose constraints on which groups of users are permitted to perform subsets of those steps. ...
In this paper, we improve the complexity bounds for the workflow satisfiability problem. ...
On the one hand, Wang and Li make the constituent sets of the constraints more complex: where Crampton assumed that both sets were singletons, Wang and Li allow at most one of those sets to have cardinality ...
doi:10.1145/2382196.2382287
dblp:conf/ccs/CramptonGY12
fatcat:pjisortvhzc73afqa7yfvzsf5u
On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
However, asynchrony has no impact on the communication complexity of statistical RMT protocols. 2. ...
In this paper, we study the communication complexity of Reliable Message Transmission (RMT) and Secure Message Transmission (SMT) protocols in asynchronous settings. ...
. , n, S computes f S i (x) = Q S (x, i) and the authentication values
Table 1 . 1 Existing bounds for RMT and SMT protocols Type of
Type of
n
Bound on
Protocol
Channels
the Communication Complexity ...
doi:10.1007/978-3-642-31912-9_30
fatcat:hkutit4rx5frbczzge3udlpxzq
On the Communication Complexity of Secure Function Evaluation with Long Output
2015
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science - ITCS '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We study the communication complexity of secure function evaluation (SFE). ...
Since the size of the circuit is independent of L (ignoring logarithmic factors), so is the communication complexity of this protocol. ...
Acknowledgements The second author would like to thank Craig Gentry and Vinod Vaikuntanathan for bringing the question of output-size dependence to his attention in a conversation several years back. ...
doi:10.1145/2688073.2688105
dblp:conf/innovations/HubacekW15
fatcat:klhh4zbh7bcqddlu3jz57icjk4
Anonymous Identity-Based Broadcast Encryption with Constant Decryption Complexity and Strong Security
2016
Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security - ASIA CCS '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The existing AIBBE schemes fail to achieve efficient decryption or strong security, like the constant decryption complexity, the security under the adaptive attack, or the security in the standard model ...
The biggest contribution in our work is the proposed AIBBE scheme with constant decryption complexity and the provable security under the adaptive attack in the standard model. ...
The authors would like to thank the reviewers for their valuable suggestions that help to improve the paper greatly. ...
doi:10.1145/2897845.2897853
dblp:conf/ccs/XuLWJ16
fatcat:zu73ct6spjagbob3qp4vqnmc5e
Concealing complex policies with hidden credentials
2004
Proceedings of the 11th ACM conference on Computer and communications security - CCS '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
We also propose a substantially improved secret splitting scheme for enforcing complex policies, and show how it improves concealment of policies from nonsatisfying recipients. ...
ACKNOWLEDGEMENTS Thanks to Hilarie Orman, Rich Schroeppel, Roger Dingledine and the anonymous reviewers for their invaluable contributions. ...
Complex Policy A complex policy is a monotonic Boolean expression of one or more simple policies which must be satisfied to decrypt a resource. ...
doi:10.1145/1030083.1030104
dblp:conf/ccs/BradshawHS04
fatcat:zrnfxc4on5cspcqlxzywy733a4
ID-based encryption for complex hierarchies with applications to forward security and broadcast encryption
2004
Proceedings of the 11th ACM conference on Computer and communications security - CCS '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The security of our schemes is based on the bilinear Diffie-Hellman assumption in the random oracle model. ...
Due to the inherent key-escrow property 1 , the standard notion of HIBE security crucially depends on secret keys remaining secret. ...
(b) Compute W ⊕
D fs-HIBE: Proof of Security The proof of one-way security against nonadaptive chosen time and target adversary is given in Section D. 2 . ...
doi:10.1145/1030083.1030130
dblp:conf/ccs/YaoFDL04
fatcat:eie6dpfsbbckhamncqa7lyakei
Is complexity really the enemy of software security?
2008
Proceedings of the 4th ACM workshop on Quality of protection - QoP '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Software complexity is often hypothesized to be the enemy of software security. ...
It may be necessary to create new complexity metrics to embody the type of complexity that leads to security problems. ...
Software complexity is often hypothesized to be the enemy of software security [8] . The wisdom of security experts is that complexity leads to security problems [3, 8] . ...
doi:10.1145/1456362.1456372
dblp:conf/ccs/ShinW08
fatcat:wrgu34jakvacfka24nbos3t7fa
Periodicity, complementarity and complexity of 2-adic FCSR combiner generators
2006
Proceedings of the 2006 ACM Symposium on Information, computer and communications security - ASIACCS '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We use this fact to derive upper bounds on the linear complexity and the 2-adic complexity of the output sequence of the FCSR-combiner. ...
This choice is motivated by an observation of Arnault and Berger on the high nonlinearity of the FCSR and that of Siegenthaler on the tradeoff between resilience and correlation immunity of boolean functions ...
ACKNOWLEDGEMENTS The first author wishes to gratefully acknowledge the generous support of the AU-KBC Research Centre in awarding him a research fellowship during the period July 2002 to June 2005. ...
doi:10.1145/1128817.1128858
dblp:conf/ccs/AnandR06
fatcat:nuv46cimebdjljmcoigrfm6h24
Reducing the round complexity of a sealed-bid auction protocol with an off-line TTP
2000
Proceedings of the 7th ACM conference on Computer and communications security - CCS '00
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
advantage and that copies bear this notice and the full citation on the first page. ...
INTRODUCTION Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial ...
ANALYSIS
Anonymity of Bidder's Identity ...
doi:10.1145/352600.352612
dblp:conf/ccs/WatanabeI00
fatcat:yjufnxe22zfqxcccfablezb3v4
SlowFuzz
2017
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2017 pre-print arXiv:1708.08437v1 fatcat:e6w65rn7wzgxdnubndosr2s24i
Algorithmic complexity vulnerabilities occur when the worst-case time/space complexity of an application is significantly higher than the respective average case for particular user-controlled inputs. ...
Such attacks have been known to have serious effects on production systems, take down entire websites, or lead to bypasses of Web Application Firewalls. ...
Any opinions, ndings, conclusions, or recommendations expressed herein are those of the authors, and do not necessarily re ect those of the US Government, ONR, NSF, or Google. ...
doi:10.1145/3133956.3134073
dblp:conf/ccs/PetsiosZKJ17
fatcat:sop7353vf5epzdrlah2xslinam
« Previous
Showing results 1 — 15 out of 554,911 results