03975oam 2200469 450 99641830210331620210602080357.03-030-64378-610.1007/978-3-030-64378-2(CKB)5340000000066974(DE-He213)978-3-030-64378-2(MiAaPQ)EBC6424517(PPN)252514467(EXLCZ)99534000000006697420210602d2020 uy 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierTheory of cryptography 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings, part II /Rafael Pass, Krzysztof Pietrzak (Eds.)1st ed. 2020.Cham, Switzerland :Springer,[2020]©20201 online resource (XII, 715 p. 139 illus., 25 illus. in color.) Lecture Notes in Computer Science ;125513-030-64377-8 Proof-Carrying Data from Accumulation Schemes -- Linear-Time Arguments with Sublinear Verification from Tensor Codes -- Barriers for Succinct Arguments in the Random Oracle Model -- Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction -- Batch Verification and Proofs of Proximity with Polylog Overhead -- Batch Verification for Statistical Zero Knowledge Proofs -- Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads -- On the Price of Concurrency in Group Ratcheting Protocols -- Stronger Security and Constructions of Multi-Designated Verifier Signatures -- Continuous Group Key Agreement with Active Security -- Round Optimal Secure Multiparty Computation from Minimal Assumptions -- Reusable Two-Round MPC from DDH -- Mr NISC: Multiparty Reusable Non-Interactive Secure Computation -- Secure Massively Parallel Computation for Dishonest Majority -- Towards Multiparty Computation Withstanding Coercion of All Parties -- Synchronous Constructive Cryptography -- Topology-Hiding Communication from Minimal Assumptions. -- Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More -- On Statistical Security in Two-Party Computation -- The Resiliency of MPC with Low Interaction: The Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures -- On the Power of an Honest Majority in Three-Party Computation Without Broadcast -- A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity -- On the Round Complexity of the Shuffle Model.This three-volume set, LNCS 12550, 12551, and 12552, constitutes the refereed proceedings of the 18th International Conference on Theory of Cryptography, TCCC 2020, held in Durham, NC, USA, in November 2020. The total of 71 full papers presented in this three-volume set was carefully reviewed and selected from 167 submissions. Amongst others they cover the following topics: study of known paradigms, approaches, and techniques, directed towards their better understanding and utilization; discovery of new paradigms, approaches and techniques that overcome limitations of the existing ones, formulation and treatment of new cryptographic problems; study of notions of security and relations among them; modeling and analysis of cryptographic algorithms; and study of the complexity assumptions used in cryptography. Due to the Corona pandemic this event was held virtually.Lecture notes in computer science ;12551.Data encryption (Computer science)CongressesData encryption (Computer science)005.82Pass RafaelPietrzak KrzysztofMiAaPQMiAaPQUtOrBLWBOOK996418302103316Theory of Cryptography772206UNISA01006nam a22002531i 450099100186747970753620031230155451.0040407s1947 fr |||||||||||||||||fre b12835341-39ule_instARCHE-081496ExLDip.to Scienze StoricheitaA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l.189Vajda, Georges161910Introduction a la pensée juive du Moyen age /par Georges VajdaParis :Librairie philosophique J. Vrin,1947VIII, 244 p. ;26 cmEtudes de philosophie médiévale ;35Filosofia ebraica medievale.b1283534102-04-1416-04-04991001867479707536LE009 MSM VII Coll. 8/3512009000188099le009-E0.00-no 02020.i1338795916-04-04Introduction a la pensée juive du Moyen age296707UNISALENTOle00916-04-04ma -frefr 0101777nam0 2200421 i 450 CAG077757220251003044103.08814109192IT2005-1552 20040921d2004 ||||0itac50 baitaitz01i xxxe z01nˆLo ‰scioglimento del matrimonioGiovanni Bonilini, Ferruccio Tommaseo2. ed. aggiornata ed ampliataMilanoGiuffrè2004XXII, 1130 p.25 cmˆIl ‰Codice civile. CommentarioNella pagina contro il front.: Art. 149 e L. 1. dicembre 1970, n. 898.001CFI00513082001 ˆIl ‰Codice civile. CommentarioArt. 149 e L. 1. dicembre 1970, n. 898BVE0370545MatrimonioScioglimentoLegislazioneFIRCFIC095162I346.0112346.450166DIVORZIO, SEPARAZIONE, ANNULLAMENTO. ITALIA21346.4501660263821Bonilini, GiovanniCFIV016103070229873Tommaseo, FerruccioCFIV006421070229413ITIT-00000020040921IT-BN0095 IT-NA0438 IT-NA0070 NAP 01COM $NAP BU5 B Propedeutica. Formato cm. 20,1-28.NAP BDSALA D Comprende monografie, per lo più codici giuridici e operre enciclopediche CAG0777572Biblioteca Centralizzata di Ateneo 01COM (C) 346.45 COM SCH 01C 0080023685 VMA 1 v.B 2013051620130516 01 BD BUScioglimento del matrimonio61463UNISANNIO