作者: Contracture 時(shí)間: 2025-3-21 22:42 作者: 決定性 時(shí)間: 2025-3-22 01:11 作者: 使害羞 時(shí)間: 2025-3-22 08:02 作者: 細(xì)絲 時(shí)間: 2025-3-22 09:31
Trade-Offs in Information-Theoretic Multi-party One-Way Key Agreement and Carol. We derive joint bounds on the lengths of these keys. Our protocols combine distributed variants of Slepian-Wolf coding and the leftover hash lemma. The obtained bounds are expressed in terms of smooth Rényi entropies and show that these quantities are useful in this—single-serving—context as well.作者: Carcinogen 時(shí)間: 2025-3-22 14:43 作者: Malleable 時(shí)間: 2025-3-22 18:40
Almost Secure (1-Round, ,-Channel) Message Transmission Schemeheaters. By using our equivalence, we derive a lower bound on the communication complexity of almost secure MT schemes. Finally, we present a near optimum scheme which meets our bound approximately. This is the first construction of provably secure almost secure (1-round, .-channel) MT schemes for .?=?2.?+?1.作者: Cirrhosis 時(shí)間: 2025-3-23 00:10
Anonymous Quantum Communicatione quantum state can only be destroyed with exponentially small probability: if?the protocol succeeds, the state is transferred to the receiver and otherwise it remains in the hands of the sender (provided the receiver is honest).作者: ANNUL 時(shí)間: 2025-3-23 03:59
Unconditionally Secure Chaffing-and-Winnowing for Multiple Usetime pad with a short ciphertext size. Interestingly, when applying this method to a known A-code, this becomes a known construction of a non-malleable one-time pad. This fact implies that the notions of authentication and encryption can be seamlessly connected by chaffing-and-winnowing mechanism.作者: Heart-Rate 時(shí)間: 2025-3-23 06:27
Secret Sharing Comparison by Transformation and Rotationhe inputs become available, this is important for practical implementations of multiparty computations, where one can have a set-up phase. Ignoring pre-processing in the analysis, only two rounds and 4? invocations of the multiplication protocol are required.作者: 火海 時(shí)間: 2025-3-23 10:54
Efficient Oblivious Transfer Protocols Achieving a Non-zero Rate from Any Non-trivial Noisy Correlat Building on their result, we extend it in two ways: 1) we construct efficient passively-secure protocols achieving the same rates; 2) we show that an important class of noisy correlations actually allows to build OT with non-zero rate secure against active cheating (before, positive rates were only achieved for the erasure channel).作者: 走調(diào) 時(shí)間: 2025-3-23 17:30
Commitment and Authentication Systemsion of an authentication system and a cipher system and the conclusion follows that this is the case for all optimal commitment systems..We also show how to build optimal schemes from transversal designs that are easy to build and can be more efficiently implemented than the proposal in the previously cited paper.作者: 退潮 時(shí)間: 2025-3-23 20:41 作者: Pituitary-Gland 時(shí)間: 2025-3-23 22:17
Conference proceedings 2009ITS 2007, held in Madrid, Spain, in May 2007. The 13 revised full papers presented in this volume were carefully reviewed and selected from 26 submissions. There were one invited keynote speech and 3 invited talks to the conference. The topics covered are authentication, group cryptography, private 作者: 考古學(xué) 時(shí)間: 2025-3-24 03:19
0302-9743 curity, ICITS 2007, held in Madrid, Spain, in May 2007. The 13 revised full papers presented in this volume were carefully reviewed and selected from 26 submissions. There were one invited keynote speech and 3 invited talks to the conference. The topics covered are authentication, group cryptography作者: 恫嚇 時(shí)間: 2025-3-24 06:44 作者: Fibrinogen 時(shí)間: 2025-3-24 13:36 作者: NEG 時(shí)間: 2025-3-24 16:15 作者: 好忠告人 時(shí)間: 2025-3-24 19:04
https://doi.org/10.1007/978-3-642-10230-1Kolmogorov complexity; access control; authentication; broadcast encryption; commitment; communication ef作者: DAMP 時(shí)間: 2025-3-25 02:53
978-3-642-10229-5Springer-Verlag Berlin Heidelberg 2009作者: GRAVE 時(shí)間: 2025-3-25 06:08 作者: aerobic 時(shí)間: 2025-3-25 09:23
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/i/image/465742.jpg作者: 猛烈責(zé)罵 時(shí)間: 2025-3-25 14:12
Commitment and Authentication Systemsy secure commitment schemes and unconditionally secure authentication schemes, and that an unconditionally secure commitment scheme can be built from such an authentication scheme and an unconditionally secure cipher system..To investigate the opposite direction, we define optimal commitment systems作者: Genetics 時(shí)間: 2025-3-25 15:59
Unconditionally Secure Blind Signaturesret for the signer. Blind signature schemes have mainly been studied from a viewpoint of computational security so far. In this paper, we study blind signatures in unconditional setting. Specifically, we newly introduce a model of unconditionally secure blind signature schemes (USBS, for short). Als作者: 起皺紋 時(shí)間: 2025-3-25 22:21 作者: badinage 時(shí)間: 2025-3-26 00:21
Trade-Offs in Information-Theoretic Multi-party One-Way Key Agreementgle piece of information, jointly distributed according to some distribution .. Additionally, authentic public communication is possible from Alice to Carol and from Bob to Carol. Their goal is to establish two information-theoretically secret keys, one known to Alice and Carol, and one known to Bob作者: Condescending 時(shí)間: 2025-3-26 07:00
Improvement of Collusion Secure Convolutional Fingerprinting Information Codese codes are a concatenation of a convolutional code and a Boneh-Shaw code. In their paper Zhu . present a code construction that is not necessarily .-secure with .-error because in their modified detection algorithm the standard Viterbi error probability analysis cannot be directly applied. In this 作者: 眼界 時(shí)間: 2025-3-26 09:34
On Exponential Lower Bound for Protocols for Reliable Communication in Networks. The extant literature’s perspective of the problem of reliable communication, especially in networks whose topology is known, is that of a simple problem to which even some naive solutions (like message-flooding etc.) turn out to be reasonably efficient. In this paper, we give an example of a dire作者: 縫紉 時(shí)間: 2025-3-26 14:15
Almost Secure (1-Round, ,-Channel) Message Transmission Schemennels that the adversary can corrupt. Then does there exist an . secure MT scheme for .?=?2.?+?1 ? In this paper, we first sum up a number flaws of the previous . secure MT scheme presented at Crypto 2004. We next show an equivalence between almost secure MT schemes and secret sharing schemes with c作者: 忙碌 時(shí)間: 2025-3-26 17:42 作者: 簡略 時(shí)間: 2025-3-27 00:24 作者: RAFF 時(shí)間: 2025-3-27 01:47 作者: WATER 時(shí)間: 2025-3-27 07:42
Strongly Multiplicative Hierarchical Threshold Secret Sharing hierarchy. First, we give necessary conditions for multiplication of secrets in a hierarchical threshold linear secret sharing scheme (LSSS). Starting with known ideal constructions, we then propose a modified scheme with improved multiplication properties. We give sufficient conditions for the new作者: CAMP 時(shí)間: 2025-3-27 12:14
Secret Sharing Comparison by Transformation and Rotationme ., it is possible to compute a sharing of . such that .?=?(.?
作者: 征稅 時(shí)間: 2025-3-27 17:34 作者: violate 時(shí)間: 2025-3-27 21:04
Efficient Oblivious Transfer Protocols Achieving a Non-zero Rate from Any Non-trivial Noisy Correlatsecurity for both parties, hence building OT assuming noisy resources (channels or correlations) available to them. This primitive is about transmitting two strings such that the receiver can obtain one (and only one) of them, while the sender remains ignorant of this choice. Recently, Winter and Na作者: 角斗士 時(shí)間: 2025-3-28 00:39 作者: Hallowed 時(shí)間: 2025-3-28 06:01 作者: 動(dòng)脈 時(shí)間: 2025-3-28 06:28
Renato Renner,Stefan Wolf,Jürg Wullschlegerntend with combination of cycles from both the nominal series and the deflator series, which could generate spurious measures of co-movement. The spectral work indicates that there is evidence of the ‘great moderation’ in Price, Construction Expenditure, Income, and Consumption within longer cycles 作者: Offset 時(shí)間: 2025-3-28 10:35 作者: 長矛 時(shí)間: 2025-3-28 15:47 作者: 變色龍 時(shí)間: 2025-3-28 22:14 作者: Licentious 時(shí)間: 2025-3-29 00:14 作者: 生命層 時(shí)間: 2025-3-29 03:26
Shuhong Wang,Reihaneh Safavi-Nainialthough the hydroxyannulenium ions are comparable in this respect with the annulenes. The higher annulenones are also sensitive to perturbations, quite small alterations in structure are sufficient to destroy the diatropicity and paratropicity of these systems. This is in keeping with the diminishe作者: 歡樂中國 時(shí)間: 2025-3-29 11:12
Wataru Kitada,Goichiro Hanaoka,Kanta Matsuura,Hideki Imaialthough the hydroxyannulenium ions are comparable in this respect with the annulenes. The higher annulenones are also sensitive to perturbations, quite small alterations in structure are sufficient to destroy the diatropicity and paratropicity of these systems. This is in keeping with the diminishe作者: Melodrama 時(shí)間: 2025-3-29 12:06 作者: 嫻熟 時(shí)間: 2025-3-29 18:09
Emilia K?sper,Ventzislav Nikov,Svetla Nikovaolds in modern physics - notably string theory. An interesting class of Calabi-Yau manifolds is given by those with complex multiplication (CM). Calabi-Yau manifolds with CM are also of interest in theoretical physics, e. g. in connection with mirror symmetry and black hole attractors. It is the mai作者: Brain-Waves 時(shí)間: 2025-3-29 23:47
Tord Ingolf Reistad,Tomas Toftons is the importance of Calabi-Yau 3-manifolds in modern physics - notably string theory. An interesting class of Calabi-Yau manifolds is given by those with complex multiplication (CM). Calabi-Yau manifolds with CM are also of interest in theoretical physics, e. g. in connection with mirror symmet作者: Lacerate 時(shí)間: 2025-3-30 02:56 作者: insightful 時(shí)間: 2025-3-30 05:27
Hideki Imai,Kirill Morozov,Anderson C. A. Nascimentoolds in modern physics - notably string theory. An interesting class of Calabi-Yau manifolds is given by those with complex multiplication (CM). Calabi-Yau manifolds with CM are also of interest in theoretical physics, e. g. in connection with mirror symmetry and black hole attractors. It is the mai作者: Hyaluronic-Acid 時(shí)間: 2025-3-30 08:35
L. Antunes,S. Laplante,A. Pinto,L. Salvadorolds in modern physics - notably string theory. An interesting class of Calabi-Yau manifolds is given by those with complex multiplication (CM). Calabi-Yau manifolds with CM are also of interest in theoretical physics, e. g. in connection with mirror symmetry and black hole attractors. It is the mai作者: PTCA635 時(shí)間: 2025-3-30 15:56 作者: Badger 時(shí)間: 2025-3-30 19:23 作者: 牽連 時(shí)間: 2025-3-30 21:06
New Results on Unconditionally Secure Multi-receiver Manual Authenticationaunched in this model and demonstrate that the single receiver lower bound 2log(1/.)?+?.(1) on the bandwidth of manual channel stays valid in the multireceiver scenario. We further propose a protocol that achieves this bound and provides security, in the sense that we define, if up to . receivers ar作者: 半導(dǎo)體 時(shí)間: 2025-3-31 01:58
Cryptographic Security of Individual Instanceso account the computational difficulty of extracting information. We present a new notion of security based on Kolmogorov complexity. The first goal is to provide a formal definition of what it means for an individual instance to be secure. The second goal is to bridge the gap between information th作者: 皺痕 時(shí)間: 2025-3-31 08:40
Tord Ingolf Reistad,Tomas Toftfolds with dense sets of ?bers withCM are constructed in the remaining ?ve chapters. In the appendix one ?nds examples of Calabi-Yau 3-manifolds with complex mul- plication which are not necess978-3-642-00638-8978-3-642-00639-5Series ISSN 0075-8434 Series E-ISSN 1617-9692 作者: 肌肉 時(shí)間: 2025-3-31 12:47
Gilles Brassard,Anne Broadbent,Joseph Fitzsimons,Sébastien Gambs,Alain Tappfolds with dense sets of ?bers withCM are constructed in the remaining ?ve chapters. In the appendix one ?nds examples of Calabi-Yau 3-manifolds with complex mul- plication which are not necess978-3-642-00638-8978-3-642-00639-5Series ISSN 0075-8434 Series E-ISSN 1617-9692 作者: Celiac-Plexus 時(shí)間: 2025-3-31 17:25
Alexandre Pinto,André Souto,Armando Matos,Luís Antunes
