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.
Filters
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
[chapter]
Advances in Cryptology – EUROCRYPT 2008
Preserved Fulltext
In this paper, we present new constructions for UC secure computation using tamper proof hardware (in a stronger model). ...
Furthermore, our construction models the interaction with the tamper-resistant hardware as a simple request-reply protocol. ...
Independent of our work, Damgard et al [DNW07] proposed a new construction for UC secure computation in the tamper proof hardware model. ...
doi:10.1007/978-3-540-78967-3_31
dblp:conf/eurocrypt/ChandranGS08
fatcat:wdhw3koeufbhdkapioieu63tya
Founding Cryptography on Tamper-Proof Hardware Tokens
[chapter]
2010
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 2018; you can also visit the original URL.
The file type is application/pdf.
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. ...
A recent line of work initiated by Katz examined the problem of achieving UC-secure computation using hardware tokens. ...
We thank Jürg Wullschleger for pointing out the relevance of [27] and for other helpful comments. We thank Guy Rothblum for useful discussions. ...
doi:10.1007/978-3-642-11799-2_19
fatcat:wbydcvt2gjhw3jjsi22x3dtc7m
Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
[chapter]
2011
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 2018; you can also visit the original URL.
The file type is application/pdf.
However, all known protocols employing tamper-proof hardware are either indirect, i.e., additional computational assumptions must be used to obtain general two party computations or a large number of devices ...
In this work we present the first protocol realizing universally composable two-party computations (and even trusted One-Time-Programs) with informationtheoretic security using only one single tamper-proof ...
We would like to thank the anonymous reviewers of TCC 2011 for their helpful comments. ...
doi:10.1007/978-3-642-19571-6_11
fatcat:5nlayinf7rb33bsjp76p4tmghe
BiTR: Built-in Tamper Resilience
[chapter]
2011
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.
In particular, we achieve general UC-secure computation based on a hardware token that may be susceptible to affine tampering attacks. ...
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. ...
We are grateful to Li-Yang Tan and Daniel Wichs for useful discussions regarding this work. ...
doi:10.1007/978-3-642-25385-0_40
fatcat:rvus2wzmkbbtzcxnlsav2krprq
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
[chapter]
2007
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 2015; you can also visit the original URL.
The file type is application/pdf.
We propose a new setup assumption -more along the lines of a physical assumption regarding the existence of tamper-proof hardware -which also suffices to circumvent the impossibility result mentioned above ...
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. ...
Acknowledgments I am very grateful to the anonymous referees for their supportive comments and helpful suggestions. ...
doi:10.1007/978-3-540-72540-4_7
fatcat:msgavyv5enbzfpsvbni2j6u7gu
From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions
[chapter]
2015
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 2016; you can also visit the original URL.
The file type is application/pdf.
Motivated by the ubiquitous use of secure hardware in many real world security applications, Katz (EUROCRYPT 2007) proposed a model of tamper-proof hardware as a UC-setup assumption. ...
Real world examples of tamper-proof hardware that can hold a state are expensive hardware security modules commonly used in mainframes. ...
The authors acknowledge support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive ...
doi:10.1007/978-3-319-26059-4_2
fatcat:rbttqcxwz5btfj6xhxwcgkk3i4
Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens
[chapter]
2013
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 2017; you can also visit the original URL.
The file type is application/pdf.
Resettable hardware tokens, usually in the form of smart cards, are used for a variety of security-critical tasks in open environments. Many of these tasks require trusted hardware tokens. ...
In this work, we consider the problem of realizing general UC-functionalities from untrusted resettable hardware-tokens, with the goal of minimizing both the amount of interaction and the number of tokens ...
As our main contribution we provide two constructions for securely realizing the CRS functionality with resettable tamper-proof hardware tokens. ...
doi:10.1007/978-3-642-36594-2_36
fatcat:ojklbkrgfzhebe5f6emiaewa2i
Universally Composable Multiparty Computation with Partially Isolated Parties
[chapter]
2009
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 2018; you can also visit the original URL.
The file type is application/pdf.
For example, isolation might be achieved by asking Bob to put his functionality on a tamper-proof hardware token and assuming that Alice can prevent this token from communicating to the outside world. ...
The recent work of Katz shows that we may instead rely on physical assumptions, and in particular tamper-proof hardware tokens. ...
is isolated and cannot communicate with the environment. (2) The tamper-proof hardware token is a new and separate entity from Bob. ...
doi:10.1007/978-3-642-00457-5_19
fatcat:swtyisbl2rgwbjfqxx5lnj66uy
A Unified Framework for UC from Only OT
[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 2019; you can also visit the original URL.
The file type is application/pdf.
In [1] , the authors presented a unified framework for constructing Universally Composable (UC) secure computation protocols, assuming only enhanced trapdoor permutations. ...
This yields the first construction of constantround secure computation protocols that satisfy a meaningful notions of concurrent security (i.e., SPS security) based on tight assumptions. ...
In the tamper-proof hardware model : Goyal et. al. ...
doi:10.1007/978-3-642-34961-4_42
fatcat:xiekimrijvdwleboszjbuwp25a
Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
[chapter]
2010
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 2018; you can also visit the original URL.
The file type is application/pdf.
SFE requires expensive public key operations for each input bit of the function. This cost can be avoided by using tamper-proof hardware. ...
We propose a truly efficient String Oblivious Transfer (OT) technique relying on resettable (actually, stateless) tamper-proof token. ...
I would like to thank the anonymous referees of this paper for their valuable comments. ...
doi:10.1007/978-3-642-11799-2_20
fatcat:f2mi26qbz5aaln72jnju5xycwy
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
[chapter]
2013
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.
We show that, under computational assumptions, it is possible to UC-securely realize any functionality. ...
A major step towards understanding and securely using PUFs was recently taken in [Crypto 2011] where Brzuska, Fischlin, Schröder and Katzenbeisser model PUFs in the Universal Composition (UC) framework ...
The authors also thank Marten van Dijk and Ulrich Rührmair for extensive discussions on their and our paper. ...
doi:10.1007/978-3-642-38348-9_41
fatcat:qyty26onxregbggy652ncxynfm
Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens
[chapter]
2015
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 2015; you can also visit the original URL.
The file type is application/pdf.
Recent results have shown the usefulness of tamper-proof hardware tokens as a setup assumption for building UC-secure two-party computation protocols, thus providing broad security guarantees and allowing ...
It was shown in a series of recent papers that tamper-proof hardware tokens can be used as a cryptographic setup assumption to obtain Universally Composable (UC) [5] secure two-party computation protocols ...
We sketch how a information-theoretically UC-secure OT protocol from a single token can be obtained and give a construction of a compuationally UC-secure OTM protocol from a single hardware token. ...
doi:10.1007/978-3-319-17470-9_12
fatcat:ga6wec77rjfunmxoucmfdckusi
Embedded SFE: Offloading Server and Network Using Hardware Tokens
[chapter]
2010
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 2017; you can also visit the original URL.
The file type is application/pdf.
Hardware assumption. We assume T is tamper-proof or tamper-resistant. We argue that this assumption is reasonable. ...
We informally argue the security of the modifications as they are described. Formal proofs can be naturally built from proofs of [15] and our security arguments. ...
We would like to thank Wilko Henecka for preparing test circuits, and Ivan Damgård and reviewers of FC'10 for their helpful comments. ...
doi:10.1007/978-3-642-14577-3_17
fatcat:ovhlibvhdfdrhl7hcf6sp5vozi
A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models
[chapter]
2017
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.
Using our framework, we improve black-box constructions in the common reference string and tamper-proof hardware token models by weakening the underlying computational and setup assumptions. ...
We present a unified framework for obtaining black-box constructions of Universal Composable (UC) protocol in trusted setup models. ...
We sincerely thank the anonymous reviewers for their incredibly helpful and insightful comments and suggestions. ...
doi:10.1007/978-3-319-70500-2_26
fatcat:bytospaqiff4bmrujryrb66qry
Bringing People of Different Beliefs Together to Do UC
[chapter]
2011
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.
Known constructions of UC secure protocols are based on the premise that different parties collectively agree on some trusted setup. ...
We present a general condition on the setups and the beliefs of all the parties under which UC security is possible. ...
For instance, let us consider the tamper-proof hardware token setup of Katz [14] . ...
doi:10.1007/978-3-642-19571-6_19
fatcat:tx4yz7y7h5gqfjn4amnud3toja
« Previous
Showing results 1 — 15 out of 393 results