Filters








1,422 Hits in 1.4 sec

Everlasting Multi-party Computation [chapter]

Dominique Unruh
2013 Lecture Notes in Computer Science  
We define a variant of the Universal Composability framework, everlasting quantum-UC, and show that in this model, we can implement secure communication and general multi-party computation using signature  ...  A protocol has everlasting security if it is secure against adversaries that are computationally unlimited after the protocol execution.  ...  2015 (3.2.1202.12-0001), by the European Social Fund's Doctoral Studies and Internationalisation Programme DoRa, by the European Regional Development Fund through the Estonian Center of Excellence in Computer  ... 
doi:10.1007/978-3-642-40084-1_22 fatcat:4o7uneh3mnh7bn5zva3oafvzjm

Everlasting Multi-party Computation

Dominique Unruh
2018 Journal of Cryptology  
We define a variant of the Universal Composability framework, everlasting quantum-UC, and show that in this model, we can implement secure communication and general multi-party computation using signature  ...  A protocol has everlasting security if it is secure against adversaries that are computationally unlimited after the protocol execution.  ...  Improvements & Future Work (a) Give protocols for multi-party computation. We have only discussed two-party computation.  ... 
doi:10.1007/s00145-018-9278-z fatcat:zlbmu25wanf5rhfps26avdlcta

On the Security of Password-Authenticated Quantum Key Exchange [article]

Céline Chevalier, Marc Kaplan, Quoc Huy Vu
2019 arXiv   pre-print
to be computational during the execution of the protocol, which seems quite a reasonable assumption for nowadays practical use-cases.  ...  We then answer this open question positively by presenting a construction for quantum PAKE that provably achieves everlasting security in the simulation-based model.  ...  [Unr13] proves that signature cards assumption is complete for everlasting secure two-party computation.  ... 
arXiv:1904.01526v2 fatcat:w2vwzupckjg3zjaqdlyajuhuvy

Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security [chapter]

Robin Künzler, Jörn Müller-Quade, Dominik Raub
2009 Lecture Notes in Computer Science  
[STOC'87]) that are computationally secure (without fairness) in presence of an actively corrupted majority of the participants.  ...  Therefore, we ask which functions can be computed with long-term security, where we admit computational assumptions for the duration of a computation, but require IT security (privacy) once the computation  ...  , for the most part in the multi-party setting.  ... 
doi:10.1007/978-3-642-00457-5_15 fatcat:adwisetkbrexpgrul5fsiv65mq

Security Threat Solution over Single Cloud To Multi-Cloud Using DepSky Model

Monali Shrawankar
2013 IOSR Journal of Computer Engineering  
Cloud computing delivers IT resources as a Service over Internet The advantage of cloud computing is everlasting but it brings more issues including security.  ...  Cloud storage providers may be single cloud or multi-cloud.  ...  As data and information will be shared with a third party, cloud computing users want to avoid an untrusted cloud provider.  ... 
doi:10.9790/0661-1417176 fatcat:ubkfiat6qnctzpplpol6wusdr4

Comparative Study of Security Mechanisms in Multi-cloud Environment

Monali Shrawankar, Ashish Kr. Shrivastava
2013 International Journal of Computer Applications  
The advantage of cloud computing is everlasting but it brings more issues including security.  ...  Cloud storage providers may be single cloud or multi-cloud.  ...  As facts and figures and data will be distributed with a third party, cloud computing users that can advantage its customers, such as very quick access to their data from any position, scalability, pay-for-use  ... 
doi:10.5120/13396-1039 fatcat:j2s46uschva3jpue4hqkfd3hfq

Practical Governmental Voting with Unconditional Integrity and Privacy [chapter]

Nan Yang, Jeremy Clark
2017 Lecture Notes in Computer Science  
A minority of papers have looked at the inverse scenario: everlasting privacy with computational integrity.  ...  the voter casts an in-person (and possibly paper) ballot and leaves, as is common in a governmental election, the majority of the proposals fall in the category of providing unconditional integrity and computational  ...  Some voting schemes require the voter to participate in some multi-party computation. For example, [5] requires that voters take their vote and secret-share it with different election authorities.  ... 
doi:10.1007/978-3-319-70278-0_27 fatcat:gobfldct45fspm73osyrkadj2m

Receipt-Free Universally-Verifiable Voting with Everlasting Privacy [chapter]

Tal Moran, Moni Naor
2006 Lecture Notes in Computer Science  
Our scheme is also the first receipt-free scheme to give "everlasting privacy" for votes: even a computationally unbounded party does not gain any information about individual votes (other than what can  ...  Following in the footsteps of Chaum and Neff [7,16], our protocol ensures that the integrity of an election cannot be compromised even if the computers running it are all corrupt (although ballot secrecy  ...  An open problem is to allow a complete tally without sacrificing any of the other properties of our scheme (such as receipt-freeness and everlasting privacy).  ... 
doi:10.1007/11818175_22 fatcat:gv6rthvvbrgj5ba6mw56siyycy

Towards a New Paradigm for Privacy and Security in Cloud Services [article]

Thomas Loruenser, Charles Bastos Rodriguez, Denise Demirel, Simone Fischer-Huebner, Thomas Gross, Thomas Langer, Mathieu des Noes, Henrich C. Poehls, Boris Rozenberg, Daniel Slamanig
2015 arXiv   pre-print
The market for cloud computing can be considered as the major growth area in ICT.  ...  However, big companies and public authorities are reluctant to entrust their most sensitive data to external parties for storage and processing.  ...  In fact, the third party becomes part of the company's own computation and storage IT infrastructure albeit not being under its full control.  ... 
arXiv:1506.05980v2 fatcat:bv6ziphc7jfshhwkfqlrp57iim

Efficient Rational Secret Sharing in Standard Communication Networks [chapter]

Georg Fuchsbauer, Jonathan Katz, David Naccache
2010 Lecture Notes in Computer Science  
We propose a new methodology for rational secret sharing leading to various instantiations (in both the two-party and multi-party settings) that are simple and efficient in terms of computation, share  ...  These notions guarantee, roughly speaking, that at each point in the protocol there is a unique legal message a party can send.  ...  We do not assume an on-line dealer or any trusted/honest parties, nor do we resort to generic secure multi-party computation.  ... 
doi:10.1007/978-3-642-11799-2_25 fatcat:cm7rzq6omnb4fmuu2zez25bbfi

Information Theoretically Secure Databases [article]

Gregory Valiant, Paul Valiant
2016 arXiv   pre-print
We stress that the security guarantee is information theoretic and everlasting: it relies neither on unproved hardness assumptions, nor on the assumption that the adversary is computationally or storage  ...  These guarantees are not information theoretic, and instead rely on cryptographic assumptions (and the assumption that the parties are computationally bounded).  ...  Related Work While most security and cryptographic schemes rely on the assumptions that adversaries are computationally bounded and that certain problems require super-polynomial amounts of computation  ... 
arXiv:1605.02646v1 fatcat:ykeba4zy3veyhnqpr6ikjwnmn4

Games for exchanging information

Gillat Kol, Moni Naor
2008 Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08  
We consider the rational versions of two of the classical problems in foundations of cryptography: secret sharing and multiparty computation, suggested by Halpern and Teague (STOC 2004).  ...  Previous schemes (mostly cryptographic) have required computational assumptions, making them inexact and susceptible to backward induction, or used stronger communication channels.  ...  (strict everlasting with respect to A, ε-everlasting) equilibrium that computes f C in the corresponding computing game Γ f C (the distribution over inputs in X C is determined by D Y and dealer, and  ... 
doi:10.1145/1374376.1374437 dblp:conf/stoc/KolN08 fatcat:f7sers4jr5d7jfmlcwarcqf76u

Rational Zero: Economic Security for Zerocoin with Everlasting Anonymity [chapter]

Christina Garman, Matthew Green, Ian Miers, Aviel D. Rubin
2014 Lecture Notes in Computer Science  
Background Bitcoin Bitcoin is a distributed e-cash system that operates without trusted parties or signing authorities.  ...  Pedersen commitments are computationally binding if the discrete log problem is hard.  ... 
doi:10.1007/978-3-662-44774-1_10 fatcat:cjkrw3uo5fgwzo4omvstzwkh6a

Quantum cryptography beyond quantum key distribution

Anne Broadbent, Christian Schaffner
2015 Designs, Codes and Cryptography  
While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other applications such as quantum money, randomness generation, secure two- and multi-party computation  ...  and delegated quantum computation.  ...  We briefly mention here some topics that are not included in this survey: • Everlasting security A protocol has everlasting security if it is secure against adversaries that are computationally unlimited  ... 
doi:10.1007/s10623-015-0157-4 pmid:32226229 pmcid:PMC7089691 fatcat:zm7zdq4l6babtd4y5ygwmttt2q

Cooperate Delegation of Computation for Rational Party using Zero-determinant Strategy Approach

Duo Zhang, Youliang Tian, Chaoyue Yue, Meimei Fan
2020 IEEE Access  
Finally, the performance analysis results show that the entrusting party can regulate the betrayers in the computing party through Zero-determinant Strategy to ensure the interests of honest people in  ...  cloud computing.  ...  Many computing parties constitute a computing group, but each computing party is a single independent individual when accepting computing tasks.  ... 
doi:10.1109/access.2020.2971544 fatcat:u4hqn4xiw5hq5pqpgswqopqawm
« Previous Showing results 1 — 15 out of 1,422 results