000 03580nam a22004695i 4500
001 978-3-642-30042-4
003 DE-He213
005 20140220083317.0
007 cr nn 008mamaa
008 120803s2012 gw | s |||| 0|eng d
020 _a9783642300424
_9978-3-642-30042-4
024 7 _a10.1007/978-3-642-30042-4
_2doi
050 4 _aQA76.9.D35
072 7 _aUMB
_2bicssc
072 7 _aURY
_2bicssc
072 7 _aCOM031000
_2bisacsh
082 0 4 _a005.74
_223
100 1 _aSchneider, Thomas.
_eauthor.
245 1 0 _aEngineering Secure Two-Party Computation Protocols
_h[electronic resource] :
_bDesign, Optimization, and Applications of Efficient Secure Function Evaluation /
_cby Thomas Schneider.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2012.
300 _aXVI, 138 p. 35 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aChap. 1, Introduction -- Chap. 2, Basics of Practically Efficient Secure Function Evaluation -- Chap. 3, Circuit Optimizations and Constructions -- Chap. 4, Hardware-Assisted Garbled Circuit Protocols -- Chap. 5, Modular Design of Efficient SFE Protocols -- Chap. 6, Conclusions -- References -- Index.
520 _aSecure two-party computation, called secure function evaluation (SFE), enables two mutually mistrusting parties, the client and server, to evaluate an arbitrary function on their respective private inputs while revealing nothing but the result. Originally the technique was considered to be too inefficient for practical privacy-preserving applications, but in recent years rapid speed-up in computers and communication networks, algorithmic improvements, automatic generation, and optimizations have enabled their application in many scenarios. The author offers an extensive overview of the most practical and efficient modern techniques used in the design and implementation of secure computation and related protocols. After an introduction that sets secure computation in its larger context of other privacy-enhancing technologies such as secure channels and trusted computing, he covers the basics of practically efficient secure function evaluation, circuit optimizations and constructions, hardware-assisted garbled circuit protocols, and the modular design of efficient SFE protocols. The goal of the author's research is to use algorithm engineering methods to engineer efficient secure protocols, both as a generic tool and for solving practical applications, and he achieves an excellent balance between the theory and applicability. The book is essential for researchers, students and practitioners in the area of applied cryptography and information security who aim to construct practical cryptographic protocols for privacy-preserving real-world applications.
650 0 _aComputer science.
650 0 _aComputer network architectures.
650 0 _aData structures (Computer science).
650 0 _aTelecommunication.
650 1 4 _aComputer Science.
650 2 4 _aData Structures, Cryptology and Information Theory.
650 2 4 _aComputer Systems Organization and Communication Networks.
650 2 4 _aCommunications Engineering, Networks.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642300417
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-30042-4
912 _aZDB-2-SCS
999 _c103122
_d103122