大葉大學圖書館 |

Theory of cryptography[electronic resource] :14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016 : proceedings.Part I /

紀錄類型:	書目-電子資源 : Monograph/item
杜威分類號:	005.82
書名/作者:	Theory of cryptography : 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016 : proceedings./ edited by Martin Hirt, Adam Smith.
其他題名:	TCC 2016-B
其他作者:	Hirt, Martin.
團體作者:	Clark Conference
出版者:	Berlin, Heidelberg : : Springer Berlin Heidelberg :, 2016.
面頁冊數:	xvi, 692 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Data encryption (Computer science)
標題:	Computer Science.
標題:	Data Encryption.
標題:	Systems and Data Security.
標題:	Algorithm Analysis and Problem Complexity.
標題:	Discrete Mathematics in Computer Science.
標題:	Management of Computing and Information Systems.
標題:	Computer Communication Networks.
ISBN:	9783662536414
ISBN:	9783662536407
內容註:	TCC Test-of-Time Award -- From Indifferentiability to Constructive Cryptography (and Back) -- Foundations -- Fast Pseudorandom Functions Based on Expander Graphs -- 3-Message Zero Knowledge Against Human Ignorance -- The GGM Function Family is a Weakly One-Way Family of Functions -- On the (In)security of SNARKs in the Presence of Oracles -- Leakage Resilient One-Way Functions: The Auxiliary-Input Setting -- Simulating Auxiliary Inputs, Revisited -- Unconditional Security -- Pseudoentropy: Lower-bounds for Chain rules and Transformations -- Oblivious Transfer from Any Non-Trivial Elastic Noisy Channel via Secret Key Agreement -- Simultaneous Secrecy and Reliability Amplification for a General Channel Model -- Proof of Space from Stacked Expanders -- Perfectly Secure Message Transmission in Two Rounds -- Foundations of Multi-Party Protocols -- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious -- Binary AMD Circuits from Secure Multiparty Computation -- Composable Security in the Tamper-Proof Hardware Model under Minimal Complexity -- Composable Adaptive Secure Protocols without Setup under Polytime Assumptions -- Adaptive Security of Yao's Garbled Circuits -- Round Complexity and Efficiency of Multi-Party Computation -- Efficient Secure Multiparty Computation with Identifiable Abort -- Secure Multiparty RAM Computation in Constant Rounds -- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model -- More Efficient Constant-Round Multi-Party Computation from BMR and SHE -- Cross&Clean: Amortized Garbled Circuits With Constant Overhead -- Differential Privacy -- Separating Computational and Statistical Differential Privacy in the Client-Server Model -- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds -- Strong Hardness of Privacy from Weak Traitor Tracing.
摘要、提要註:	The two-volume set LNCS 9985 and LNCS 9986 constitutes the refereed proceedings of the 14th International Conference on Theory of Cryptography, TCC 2016-B, held in Beijing, China, in November 2016. The total of 45 revised full papers presented in the proceedings were carefully reviewed and selected from 113 submissions. The papers were organized in topical sections named: TCC test-of-time award; foundations; unconditional security; foundations of multi-party protocols; round complexity and efficiency of multi-party computation; differential privacy; delegation and IP; public-key encryption; obfuscation and multilinear maps; attribute-based encryption; functional encryption; secret sharing; new models.
電子資源:	http://dx.doi.org/10.1007/978-3-662-53641-4

Theory of cryptography[electronic resource] :14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016 : proceedings.Part I /
Theory of cryptography14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016 : proceedings.Part I /[electronic resource] :TCC 2016-Bedited by Martin Hirt, Adam Smith. - Berlin, Heidelberg :Springer Berlin Heidelberg :2016. - xvi, 692 p. :ill., digital ;24 cm. - Lecture notes in computer science,99850302-9743 ;. - Lecture notes in computer science ;7103..

TCC Test-of-Time Award -- From Indifferentiability to Constructive Cryptography (and Back) -- Foundations -- Fast Pseudorandom Functions Based on Expander Graphs -- 3-Message Zero Knowledge Against Human Ignorance -- The GGM Function Family is a Weakly One-Way Family of Functions -- On the (In)security of SNARKs in the Presence of Oracles -- Leakage Resilient One-Way Functions: The Auxiliary-Input Setting -- Simulating Auxiliary Inputs, Revisited -- Unconditional Security -- Pseudoentropy: Lower-bounds for Chain rules and Transformations -- Oblivious Transfer from Any Non-Trivial Elastic Noisy Channel via Secret Key Agreement -- Simultaneous Secrecy and Reliability Amplification for a General Channel Model -- Proof of Space from Stacked Expanders -- Perfectly Secure Message Transmission in Two Rounds -- Foundations of Multi-Party Protocols -- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious -- Binary AMD Circuits from Secure Multiparty Computation -- Composable Security in the Tamper-Proof Hardware Model under Minimal Complexity -- Composable Adaptive Secure Protocols without Setup under Polytime Assumptions -- Adaptive Security of Yao's Garbled Circuits -- Round Complexity and Efficiency of Multi-Party Computation -- Efficient Secure Multiparty Computation with Identifiable Abort -- Secure Multiparty RAM Computation in Constant Rounds -- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model -- More Efficient Constant-Round Multi-Party Computation from BMR and SHE -- Cross&Clean: Amortized Garbled Circuits With Constant Overhead -- Differential Privacy -- Separating Computational and Statistical Differential Privacy in the Client-Server Model -- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds -- Strong Hardness of Privacy from Weak Traitor Tracing.

The two-volume set LNCS 9985 and LNCS 9986 constitutes the refereed proceedings of the 14th International Conference on Theory of Cryptography, TCC 2016-B, held in Beijing, China, in November 2016. The total of 45 revised full papers presented in the proceedings were carefully reviewed and selected from 113 submissions. The papers were organized in topical sections named: TCC test-of-time award; foundations; unconditional security; foundations of multi-party protocols; round complexity and efficiency of multi-party computation; differential privacy; delegation and IP; public-key encryption; obfuscation and multilinear maps; attribute-based encryption; functional encryption; secret sharing; new models.

ISBN: 9783662536414

Standard No.: 10.1007/978-3-662-53641-4doiSubjects--Topical Terms:

369827
Data encryption (Computer science)

LC Class. No.: QA76.9.A25

Dewey Class. No.: 005.82

Theory of cryptography[electronic resource] :14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016 : proceedings.Part I /
LDR:03712nmm a2200337 a 4500 001 467495
003 DE-He213
005 20161021202951.0
006 m d
007 cr nn 008maaau
008 170511s2016 gw s 0 eng d
020 $a 9783662536414 $q (electronic bk.)
020 $a 9783662536407 $q (paper)
024 7 $a 10.1007/978-3-662-53641-4 $2 doi
035 $a 978-3-662-53641-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A25
072 7 $a URY $2 bicssc
072 7 $a COM053000 $2 bisacsh
082 0 4 $a 005.82 $2 23
090 $a QA76.9.A25 $b T396 2016
111 2 $a Clark Conference $d (2005 : $c Sterling and Francine Clark Art Institute) $3 347558
245 1 0 $a Theory of cryptography $h [electronic resource] : $b 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016 : proceedings. $n Part I / $c edited by Martin Hirt, Adam Smith.
246 3 $a TCC 2016-B
260 $a Berlin, Heidelberg : $c 2016. $b Springer Berlin Heidelberg : $b Imprint: Springer,
300 $a xvi, 692 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9985
505 0 $a TCC Test-of-Time Award -- From Indifferentiability to Constructive Cryptography (and Back) -- Foundations -- Fast Pseudorandom Functions Based on Expander Graphs -- 3-Message Zero Knowledge Against Human Ignorance -- The GGM Function Family is a Weakly One-Way Family of Functions -- On the (In)security of SNARKs in the Presence of Oracles -- Leakage Resilient One-Way Functions: The Auxiliary-Input Setting -- Simulating Auxiliary Inputs, Revisited -- Unconditional Security -- Pseudoentropy: Lower-bounds for Chain rules and Transformations -- Oblivious Transfer from Any Non-Trivial Elastic Noisy Channel via Secret Key Agreement -- Simultaneous Secrecy and Reliability Amplification for a General Channel Model -- Proof of Space from Stacked Expanders -- Perfectly Secure Message Transmission in Two Rounds -- Foundations of Multi-Party Protocols -- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious -- Binary AMD Circuits from Secure Multiparty Computation -- Composable Security in the Tamper-Proof Hardware Model under Minimal Complexity -- Composable Adaptive Secure Protocols without Setup under Polytime Assumptions -- Adaptive Security of Yao's Garbled Circuits -- Round Complexity and Efficiency of Multi-Party Computation -- Efficient Secure Multiparty Computation with Identifiable Abort -- Secure Multiparty RAM Computation in Constant Rounds -- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model -- More Efficient Constant-Round Multi-Party Computation from BMR and SHE -- Cross&Clean: Amortized Garbled Circuits With Constant Overhead -- Differential Privacy -- Separating Computational and Statistical Differential Privacy in the Client-Server Model -- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds -- Strong Hardness of Privacy from Weak Traitor Tracing.
520 $a The two-volume set LNCS 9985 and LNCS 9986 constitutes the refereed proceedings of the 14th International Conference on Theory of Cryptography, TCC 2016-B, held in Beijing, China, in November 2016. The total of 45 revised full papers presented in the proceedings were carefully reviewed and selected from 113 submissions. The papers were organized in topical sections named: TCC test-of-time award; foundations; unconditional security; foundations of multi-party protocols; round complexity and efficiency of multi-party computation; differential privacy; delegation and IP; public-key encryption; obfuscation and multilinear maps; attribute-based encryption; functional encryption; secret sharing; new models.
650 0 $a Data encryption (Computer science) $3 369827
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Data Encryption. $3 465773
650 2 4 $a Systems and Data Security. $3 466229
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 463701
650 2 4 $a Discrete Mathematics in Computer Science. $3 464912
650 2 4 $a Management of Computing and Information Systems. $3 466225
650 2 4 $a Computer Communication Networks. $3 464535
700 1 $a Hirt, Martin. $3 672748
700 1 $a Smith, Adam. $3 672749
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 7103. $3 466200
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-53641-4
950 $a Computer Science (Springer-11645)