Cargando…

Engineering Secure Two-Party Computation Protocols Design, Optimization, and Applications of Efficient Secure Function Evaluation /

Secure 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 ineff...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Schneider, Thomas (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Edición:1st ed. 2012.
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-642-30042-4
003 DE-He213
005 20220118191034.0
007 cr nn 008mamaa
008 120803s2012 gw | s |||| 0|eng d
020 |a 9783642300424  |9 978-3-642-30042-4 
024 7 |a 10.1007/978-3-642-30042-4  |2 doi 
050 4 |a QA76.9.D35 
050 4 |a Q350-390 
072 7 |a UMB  |2 bicssc 
072 7 |a GPF  |2 bicssc 
072 7 |a COM031000  |2 bisacsh 
072 7 |a UMB  |2 thema 
072 7 |a GPF  |2 thema 
082 0 4 |a 005.73  |2 23 
082 0 4 |a 003.54  |2 23 
100 1 |a Schneider, Thomas.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Engineering Secure Two-Party Computation Protocols  |h [electronic resource] :  |b Design, Optimization, and Applications of Efficient Secure Function Evaluation /  |c by Thomas Schneider. 
250 |a 1st ed. 2012. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2012. 
300 |a XVI, 138 p. 35 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a Chap. 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 |a Secure 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 |a Data structures (Computer science). 
650 0 |a Information theory. 
650 0 |a Computer engineering. 
650 0 |a Computer networks . 
650 0 |a Telecommunication. 
650 1 4 |a Data Structures and Information Theory. 
650 2 4 |a Computer Engineering and Networks. 
650 2 4 |a Communications Engineering, Networks. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642300431 
776 0 8 |i Printed edition:  |z 9783642300417 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-642-30042-4  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)