000			05102nam a22006735i 4500
001			978-3-662-53641-4
003			DE-He213
005			20240730184447.0
007			cr nn 008mamaa
008			161021s2016 gw | s |||| 0|eng d
020			_a9783662536414 _9978-3-662-53641-4
024	7		_a10.1007/978-3-662-53641-4 _2doi
050		4	_aQA268
072		7	_aGPJ _2bicssc
072		7	_aURY _2bicssc
072		7	_aCOM083000 _2bisacsh
072		7	_aGPJ _2thema
072		7	_aURY _2thema
082	0	4	_a005.824 _223
245	1	0	_aTheory of Cryptography _h[electronic resource] : _b14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I / _cedited by Martin Hirt, Adam Smith.
250			_a1st ed. 2016.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2016.
300			_aXVI, 692 p. 85 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aSecurity and Cryptology, _x2946-1863 ; _v9985
505	0		_aTCC 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			_aThe 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	_aCryptography. _91973
650		0	_aData encryption (Computer science). _99168
650		0	_aData protection. _97245
650		0	_aAlgorithms. _93390
650		0	_aComputer science _xMathematics. _93866
650		0	_aDiscrete mathematics. _912873
650		0	_aElectronic data processing _xManagement. _9135631
650		0	_aComputer networks . _931572
650	1	4	_aCryptology. _931769
650	2	4	_aData and Information Security. _931990
650	2	4	_aAlgorithms. _93390
650	2	4	_aDiscrete Mathematics in Computer Science. _931837
650	2	4	_aIT Operations. _931703
650	2	4	_aComputer Communication Networks. _9135632
700	1		_aHirt, Martin. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9135633
700	1		_aSmith, Adam. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9135634
710	2		_aSpringerLink (Online service) _9135635
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783662536407
776	0	8	_iPrinted edition: _z9783662536421
830		0	_aSecurity and Cryptology, _x2946-1863 ; _v9985 _9135636
856	4	0	_uhttps://doi.org/10.1007/978-3-662-53641-4
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cELN
999			_c92338 _d92338