標題: Titlebook: Algebraic Informatics; 5th International Co Traian Muntean,Dimitrios Poulakis,Robert Rolland Conference proceedings 2013 Springer-Verlag Be [打印本頁] 作者: 調(diào)停 時間: 2025-3-21 19:58
書目名稱Algebraic Informatics影響因子(影響力)
書目名稱Algebraic Informatics影響因子(影響力)學科排名
書目名稱Algebraic Informatics網(wǎng)絡(luò)公開度
書目名稱Algebraic Informatics網(wǎng)絡(luò)公開度學科排名
書目名稱Algebraic Informatics被引頻次
書目名稱Algebraic Informatics被引頻次學科排名
書目名稱Algebraic Informatics年度引用
書目名稱Algebraic Informatics年度引用學科排名
書目名稱Algebraic Informatics讀者反饋
書目名稱Algebraic Informatics讀者反饋學科排名
作者: 不可思議 時間: 2025-3-22 00:03
Aims and Methods of Cryptographyres, identification schemes, zero-knowledge proofs and error-correcting codes..In this talk, I will survey the current state of PoS research. This will include the many variants of PoS that have been invented over the years, how to design them, the connections that have been established between PoS 作者: fiscal 時間: 2025-3-22 01:22
0302-9743 rnational Conference on Algebraic Informatics, CAI 2013, held in?Porquerolles, France?in September 2013. The 19 revised full papers presented together with 5 invited articles were carefully reviewed and selected from numerous submissions. The papers cover topics such as data models and coding theory作者: Firefly 時間: 2025-3-22 08:32 作者: 小卒 時間: 2025-3-22 11:56 作者: 否認 時間: 2025-3-22 14:49 作者: 不給啤 時間: 2025-3-22 20:11 作者: CHOKE 時間: 2025-3-22 22:27 作者: 刺激 時間: 2025-3-23 05:21
Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automatahen to compute the greatest lower bound for the probability for . that can be guaranteed even in worst-case scenarios. Such bounds can be computed by a combination of polynomially time-bounded graph algorithm with methods for solving linear programs.作者: 寬容 時間: 2025-3-23 05:43
Strong Prefix Codes of Picturesite strong prefix codes is also considered. Given a strong prefix code, it is proved that there exists a unique maximal strong prefix code that contains it and that has a minimal size. The notion of completeness is also investigated in relation to maximality.作者: Apoptosis 時間: 2025-3-23 12:25 作者: 有節(jié)制 時間: 2025-3-23 15:44
On Elliptic Curve Paillier Schemeser scheme to the elliptic curve setting. Using similar ideas, we then present a new elliptic curve scheme which is semantically secure in the standard model. Interestingly, the new encryption scheme does not require to encode messages as points on an elliptic curve and features a partial homomorphic property.作者: RAG 時間: 2025-3-23 20:33 作者: 曲解 時間: 2025-3-23 22:29
Aims and Methods of Cryptographyer scheme to the elliptic curve setting. Using similar ideas, we then present a new elliptic curve scheme which is semantically secure in the standard model. Interestingly, the new encryption scheme does not require to encode messages as points on an elliptic curve and features a partial homomorphic property.作者: confide 時間: 2025-3-24 04:13
Conference proceedings 2013n September 2013. The 19 revised full papers presented together with 5 invited articles were carefully reviewed and selected from numerous submissions. The papers cover topics such as data models and coding theory; fundamental aspects of cryptography and security; algebraic and stochastic models of 作者: 背叛者 時間: 2025-3-24 10:04
Code Based Cryptography and Steganographyys, coding theory plays an important role in the area of cryptography and steganography. The aim of this paper is to show how algebraic coding theory offers ways to define secure cryptographic primitives and efficient steganographic schemes.作者: CLAMP 時間: 2025-3-24 13:18 作者: 護身符 時間: 2025-3-24 15:59 作者: lipoatrophy 時間: 2025-3-24 19:50
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152637.jpg作者: ACME 時間: 2025-3-25 00:10
Encryption Steps: Simple Substitutionof potential global states: consider a concurrent system with a thousand actors, each of which may be in one of 5 states. This leads to a possible 5.000 global states. Obviously, it is not feasible to exhaustively search the state space in such systems. In fact, actors often have an even larger numb作者: FLAG 時間: 2025-3-25 05:35
Encryption Steps: Simple Substitutionf a Markov decision process (MDP) and a formalization of the desired event . by an .-regular linear-time property, e.g., an LTL formula. The task is then to compute the greatest lower bound for the probability for . that can be guaranteed even in worst-case scenarios. Such bounds can be computed by 作者: Range-Of-Motion 時間: 2025-3-25 10:35
Aims and Methods of Cryptography a number of interesting properties, including a homomorphic property: the encryption of two messages allows anyone to derive the encryption of their sum. This reveals useful in cryptographic applications such as electronic voting.In this talk we review several generalizations of the original Pailli作者: thwart 時間: 2025-3-25 11:47
Aims and Methods of Cryptography client sends an encoded version of its data to the server while keeping a small amount of state locally. At any point in time, the client can then verify the integrity of its data by executing a highly-efficient challenge-response protocol with the server..Since their introduction in 2007 by Atenie作者: 移動 時間: 2025-3-25 18:18
https://doi.org/10.1007/978-3-540-48121-8ys, coding theory plays an important role in the area of cryptography and steganography. The aim of this paper is to show how algebraic coding theory offers ways to define secure cryptographic primitives and efficient steganographic schemes.作者: 玉米 時間: 2025-3-25 20:03 作者: A精確的 時間: 2025-3-26 02:47 作者: CURB 時間: 2025-3-26 07:12
https://doi.org/10.1007/978-3-642-40663-8algebraic groups; automata theory; comma codes; complexity theory; grammar systems作者: 幼兒 時間: 2025-3-26 11:58 作者: 終點 時間: 2025-3-26 14:12 作者: Dignant 時間: 2025-3-26 18:31 作者: SPURN 時間: 2025-3-27 00:53 作者: Palate 時間: 2025-3-27 01:47
Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automataf a Markov decision process (MDP) and a formalization of the desired event . by an .-regular linear-time property, e.g., an LTL formula. The task is then to compute the greatest lower bound for the probability for . that can be guaranteed even in worst-case scenarios. Such bounds can be computed by 作者: 大氣層 時間: 2025-3-27 07:50
On Elliptic Curve Paillier Schemes a number of interesting properties, including a homomorphic property: the encryption of two messages allows anyone to derive the encryption of their sum. This reveals useful in cryptographic applications such as electronic voting.In this talk we review several generalizations of the original Pailli作者: glisten 時間: 2025-3-27 09:54
Proofs of Storage: Theory, Constructions and Applications client sends an encoded version of its data to the server while keeping a small amount of state locally. At any point in time, the client can then verify the integrity of its data by executing a highly-efficient challenge-response protocol with the server..Since their introduction in 2007 by Atenie作者: epicondylitis 時間: 2025-3-27 14:27
Code Based Cryptography and Steganographyys, coding theory plays an important role in the area of cryptography and steganography. The aim of this paper is to show how algebraic coding theory offers ways to define secure cryptographic primitives and efficient steganographic schemes.作者: 不給啤 時間: 2025-3-27 21:30
Strong Prefix Codes of Picturesis proved that the corresponding family of finite strong prefix codes is decidable and it has a polynomial time decoding algorithm. Maximality for finite strong prefix codes is also considered. Given a strong prefix code, it is proved that there exists a unique maximal strong prefix code that contai作者: 代理人 時間: 2025-3-27 23:03 作者: 燈泡 時間: 2025-3-28 04:44 作者: 肌肉 時間: 2025-3-28 09:21
