LEADER 02482nam 2200373 450 001 9910724360903321 005 20230630192345.0 024 7 $a10.4000/books.psorbonne.24252 035 $a(CKB)5470000002601359 035 $a(NjHacI)995470000002601359 035 $a(EXLCZ)995470000002601359 100 $a20230630d1996 uy 0 101 0 $afre 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 14$aLes campagnes limousines du XIVe au XVIe sie?cle $eoriginalite? et limites d'une reconstruction rurale /$fJean Tricard 210 1$aParis :$cE?ditions de la Sorbonne,$d1996. 215 $a1 online resource (285 pages) 225 0 $aHistoire ancienne et me?die?vale ;$v37 320 $aIncludes bibliographical references. 330 $aL'e?tude de la reconstruction des campagnes limousines pendant la guerre de Cent Ans et jusqu'au XVIe sie?cle permet d'analyser le cas original d'un « povre pays » (Froissart) en proie a? des difficulte?s particulie?res pour remettre en culture ses terres « abses ». On est loin ici des traditionnelles reconstructions triomphantes des « bons pays » du XVe sie?cle. Victimes d'un environnement naturel hostile, de l'imbroglio des guerres - de la guerre « anglaise » a? la « guerre au village » - et des « malheurs des temps », les campagnes limousines souffrent du manque d'ambition et de capitaux des e?lites re?gionales - livres de raison et registres de notaires ruraux en font foi - d'une surprenante faiblesse de?mographique et de la fuite d'une partie de leurs paysans vers des horizons meilleurs. Si bien que les tentatives de reconstruction, cahotiques et velle?itaires, n'aboutissent - malgre? certains efforts des communaute?s paysannes et les sacrifices seigneuriaux - qu'a? des re?sultats se?lectifs et limite?s, « croissant infertile » de l'est abandonne? au profit des « fleurs de pays » de l'ouest et du sud. A tant de reconstructions re?ussies, le Limousin oppose l'originalite? d'une reconstruction rurale en partie manque?e. 517 $aCampagnes limousines du XIVe au XVIe siècle 606 $aEconomic history 615 0$aEconomic history. 676 $a330.9 700 $aTricard$b Jean$01233420 801 0$bNjHacI 801 1$bNjHacl 906 $aBOOK 912 $a9910724360903321 996 $aLes campagnes limousines du XIVe au XVIe sie?cle$92864498 997 $aUNINA LEADER 01095nam 2200385 450 001 9910812749703321 005 20230814223030.0 010 $a2-930427-96-5 035 $a(CKB)4100000004974722 035 $a(MiAaPQ)EBC5438305 035 $a(Au-PeEL)EBL5438305 035 $a(OCoLC)1043642331 035 $a(EXLCZ)994100000004974722 100 $a20200127d2018 uy 0 101 0 $afre 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aMoria $echroniques des limbes de l'Europe /$fMarie Doutrepont 210 1$a[Place of publication not identified] :$c180° e?ditions,$d[2018] 215 $a1 online resource (157 pages) 311 $a2-930427-93-0 606 $aRefugee camps 607 $aSyria$xHistory$yCivil War, 2011-$xRefugees 615 0$aRefugee camps. 676 $a362.8783 700 $aDoutrepont$b Marie$01177884 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910812749703321 996 $aMoria$93952113 997 $aUNINA LEADER 06066nam 22009135 450 001 9910483956703321 005 20251226203506.0 010 $a1-280-38567-7 010 $a9786613563590 010 $a3-642-11799-6 024 7 $a10.1007/978-3-642-11799-2 035 $a(CKB)2670000000003400 035 $a(EBL)3065037 035 $a(SSID)ssj0000355638 035 $a(PQKBManifestationID)11274873 035 $a(PQKBTitleCode)TC0000355638 035 $a(PQKBWorkID)10341219 035 $a(PQKB)10208585 035 $a(DE-He213)978-3-642-11799-2 035 $a(MiAaPQ)EBC3065037 035 $a(MiAaPQ)EBC6281476 035 $a(PPN)149073704 035 $a(MiAaPQ)EBC6272962 035 $a(EXLCZ)992670000000003400 100 $a20100715d2010 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aTheory of Cryptography $e7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010, Proceedings /$fedited by Daniele Micciancio 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (616 p.) 225 1 $aSecurity and Cryptology,$x2946-1863 ;$v5978 300 $aDescription based upon print version of record. 311 08$a3-642-11798-8 320 $aIncludes bibliographical references and author index. 327 $aParallel Repetition -- An Efficient Parallel Repetition Theorem -- Parallel Repetition Theorems for Interactive Arguments -- Almost Optimal Bounds for Direct Product Threshold Theorem -- Obfuscation -- On Symmetric Encryption and Point Obfuscation -- Obfuscation of Hyperplane Membership -- Invited Talk -- Secure Computation and Its Diverse Applications -- Multiparty Computation -- On Complete Primitives for Fairness -- On the Necessary and Sufficient Assumptions for UC Computation -- From Passive to Covert Security at Low Cost -- CCA Security -- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems -- Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs -- Threshold Cryptography and Secret Sharing -- Efficient, Robust and Constant-Round Distributed RSA Key Generation -- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems -- Ideal Hierarchical Secret Sharing Schemes -- Symmetric Cryptography -- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch -- On Related-Secret Pseudorandomness -- A Domain Extender for the Ideal Cipher -- Delayed-Key Message Authentication for Streams -- Key-Leakage and Tamper-Resistance -- Founding Cryptography on Tamper-Proof Hardware Tokens -- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens -- Leakage-Resilient Signatures -- Public-Key Encryption Schemes with Auxiliary Inputs -- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum -- Rationality and Privacy -- Rationality in the Full-Information Model -- Efficient Rational Secret Sharing in Standard Communication Networks -- Bounds on the Sample Complexity for Private Learning and Private Data Release -- Public-Key Encryption -- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts -- Robust Encryption -- Invited Talk -- Privacy-Enhancing Cryptography: From Theory into Practice -- Zero-Knowledge -- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs -- Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model -- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge -- Efficiency Limitations for ?-Protocols for Group Homomorphisms -- Composition of Zero-Knowledge Proofs with Efficient Provers -- Private Coins versus Public Coins in Zero-Knowledge Proof Systems. 330 $aThis book constitutes the refereed proceedings of the Seventh Theory of Cryptography Conference, TCC 2010, held in Zurich, Switzerland, February 9-11, 2010. The 33 revised full papers presented together with two invited talks were carefully reviewed and selected from 100 submissions.The papers are organized in topical sections on parallel repetition, obfuscation, multiparty computation, CCA security, threshold cryptography and secret sharing, symmetric cryptography, key-leakage and tamper-resistance, rationality and privacy, public-key encryption, and zero-knowledge. 410 0$aSecurity and Cryptology,$x2946-1863 ;$v5978 606 $aCryptography 606 $aData encryption (Computer science) 606 $aComputer networks 606 $aCoding theory 606 $aInformation theory 606 $aData protection 606 $aComputer science$xMathematics 606 $aAlgorithms 606 $aCryptology 606 $aComputer Communication Networks 606 $aCoding and Information Theory 606 $aData and Information Security 606 $aMathematical Applications in Computer Science 606 $aAlgorithms 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 0$aComputer networks. 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aData protection. 615 0$aComputer science$xMathematics. 615 0$aAlgorithms. 615 14$aCryptology. 615 24$aComputer Communication Networks. 615 24$aCoding and Information Theory. 615 24$aData and Information Security. 615 24$aMathematical Applications in Computer Science. 615 24$aAlgorithms. 676 $a004 702 $aMicciancio$b Daniele$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aTheory of Cryptography Conference. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483956703321 996 $aTheory of Cryptography$93000229 997 $aUNINA