000			04472nam a22006735i 4500
001			978-3-030-36030-6
003			DE-He213
005			20240423125253.0
007			cr nn 008mamaa
008			191122s2019 sz | s |||| 0|eng d
020			_a9783030360306 _9978-3-030-36030-6
024	7		_a10.1007/978-3-030-36030-6 _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] : _b17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part I / _cedited by Dennis Hofheinz, Alon Rosen.
250			_a1st ed. 2019.
264		1	_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2019.
300			_aXIV, 598 p. 357 illus., 12 illus. in color. _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 ; _v11891
505	0		_aAlgebraically Structured LWE, Revisited -- Lattice Trapdoors and IBE from Middle-Product LWE -- Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation -- Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems -- A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement -- Synchronous Consensus with Optimal Asynchronous Fallback Guarantees -- Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank -- Optimal Bounded-Collusion Secure Functional Encryption -- From FE Combiners to Secure MPC and Back -- (Pseudo) Random Quantum States with Binary Phase -- General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography -- Composable and Finite Computational Security of Quantum Message Transmission -- On Fully Secure MPC with Solitary Output -- Secure Computation with Preprocessing via Function Secret Sharing -- Efficient Private PEZ Protocols for Symmetric Functions -- TheFunction-Inversion Problem: Barriers and Opportunities -- On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations -- Characterizing Collision and Second-Preimage Resistance in Linicrypt -- Efficient Information-Theoretic Secure Multiparty Computation over Z/pkZ via Galois Rings -- Is Information-Theoretic Topology-Hiding Computation Possible -- Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation -- On Perfectly Secure 2PC in the OT-Hybrid Model.
520			_aThe two-volume set LNCS 11891 and 11892 constitutes the proceedings of the 17th International Conference on Theory of Cryptography, TCC 2019, held in Nuremberg, Germany, in December 2019. The 43 full papers presented were carefully reviewed and selected from 147 submissions. The Theory of Cryptography Conference deals with the paradigms, approaches, and techniques used to conceptualize natural cryptographic problems and provide algorithmic solutions to them and much more.
650		0	_aCryptography.
650		0	_aData encryption (Computer science).
650		0	_aComputer networks .
650		0	_aApplication software.
650		0	_aData structures (Computer science).
650		0	_aInformation theory.
650		0	_aData protection.
650		0	_aComputers.
650	1	4	_aCryptology.
650	2	4	_aComputer Communication Networks.
650	2	4	_aComputer and Information Systems Applications.
650	2	4	_aData Structures and Information Theory.
650	2	4	_aData and Information Security.
650	2	4	_aComputing Milieux.
700	1		_aHofheinz, Dennis. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aRosen, Alon. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783030360290
776	0	8	_iPrinted edition: _z9783030360313
830		0	_aSecurity and Cryptology, _x2946-1863 ; _v11891
856	4	0	_uhttps://doi.org/10.1007/978-3-030-36030-6
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cSPRINGER
999			_c176108 _d176108