A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We use (sometimes improve) tools from symbolic cryptography to obtain decision procedures or sound proof methods for program equivalence, information flow, and uniformity. ... We give characterizations of these properties based on deducibility and other notions from symbolic cryptography. ... Conclusion We have developed new symbolic methods for information-theoretic and computational security proofs of cryptographic constructions. ...doi:10.1109/csf.2019.00017 dblp:conf/csfw/BartheGJKS19 fatcat:bdp72veonjdvbksf32gbqwqmxu
Lecture Notes in Computer Science
Hence it is not obvious how one can treat cryptographic subsystems in a sound way within formal methods, in particular if one does not want to encumber the proof of an overall system by probabilities and ... The natural definitions of these subsystems are probabilistic and in most cases computational. ... Dolev-Yao Models In the past, formal methods have usually abstracted from cryptographic operations by term algebras called Dolev-Yao models or symbolic cryptography. ...doi:10.1007/11813040_44 fatcat:c7knpqnaiff6nf34qevqhkgbfq
Lecture Notes in Computer Science
Many of the explanations are informal; others are embodied in formal methods, particularly in formal methods for the analysis of security protocols. ... While there is a great deal of sophistication in modern cryptology, simple (and simplistic) explanations of cryptography remain useful and perhaps necessary. ... From Politeness to Formality With varying degrees of explicitness, many of these simplifications have been embodied in symbolic algorithms, proof systems, and other formal methods for the analysis of security ...doi:10.1007/3-540-44598-6_22 fatcat:6g2zlu5yurfhbiztu2elvu7k4e
Paillier [in Advances in cryptology—-EUROCRYPT '99 (Prague), 223-238, Lecture Notes in Comput. ... In an attempt to reduce the resulting memory and execution time overhead, a general method has recently been proposed, consisting in ‘masking’ all the intermediate data. ...
In addition, visual cryptography is integrated with the watermarking algorithm to increase the watermark capacity. ... According to the extracted watermarks, the algorithm achieves the tamper proofing and attack identification. ... In a t-out-n method of visual cryptography, a secret image is encoded into n random shares  . ...doi:10.1145/1128817.1128843 dblp:conf/ccs/PeiZ06 fatcat:ukn4jqyhwrfldfvokcoq3g4uzq
Moreover, most of the currently used public-key cryptographic schemes could be cracked in polynomial time with a quantum computer. ... Therefore, public-key cryptography is not immune to unexpectedly strong computational power or better cryptanalysis techniques. ... Traditional (pre-computer) cryptography, categorized as earlier methods of encryption and decryption, whose roots were found in Roman and Egyptian civilizations, which include Hieroglyph, Caesar Shift ...doi:10.5281/zenodo.1304105 fatcat:fiw2mkhohrggdefcnvlkh44jai
The last sections are on convincing proofs with no details (6 pages), on zero-knowledge proofs (5 pages), and on zero-knowledge proofs of identity (5 pages). There are two appendices. ... EATCS Monographs on Theoretical Computer Science, 23. Springer-Verlag, Berlin, 1990. x+245 pp. $39.00. ...
(English summary) Cryptography and coding (Cirencester, 1995), 2-12, Lecture Notes in Comput. Sci., 1025, Springer, Berlin, 1995. ... (English summary) Cryptography and coding (Cirencester, 1995), 34-43, Lecture Notes in Comput. Sci., 1025, Springer, Berlin, 1995. ...
In the case K=F_q these transformations of K^n can be of an exponential order. ... The construction of transformations is presented in terms of walks on Double Schubert Graphs. ... The implementations of such protocol of Noncommutative Cryptography for stable subgroups X of degree 3 is described in  . ...arXiv:2108.08288v1 fatcat:q7fhhlld7ncjnc7zartosa4lna
We introduce the notion of an element type for the field of residues modulo a prime number and study its role in factorial computation. ... We obtain an expression for its quantitative characteristic (the symbol of type) in terms of continued fractions and establish its connection with the Legendre symbol. ... An important role in these methods is played by the primality verification of natural numbers. Various primality tests are described in the literature on the cryptography (e.g.,    ). ...doi:10.3103/s1066369x12090058 fatcat:hy6xin7d2bbw3modcmn5zbsx2a
In this paper, we propose a new verifiable fuzzy keyword search scheme based on the symbol-tree which not only supports the fuzzy keyword search, but also enjoys the verifiability of the searching result ... We argue that a cloud server may be selfish in order to save its computation ability or bandwidth. For example, it may execute only a fraction of the search and returns part of the searching result. ... His research interests include Applied Cryptography and Security in Cloud Computing (secure outsourcing computation and cloud storage). ...doi:10.2298/csis121104028w fatcat:54ssbzo2svcz5ltqhb45tnypae
Lecture Notes in Computer Science
Ideally, one would prefer to abandon the perfect cryptography hypothesis and reason about the computational cost of breaking a cryptographic scheme by achieving such goals as gaining information about ... Using the proof assistant Coq, we provide a machine-checked account of the Generic Model and the Random Oracle Model. ... In this perspective, it is very important to provide machine-checked proofs of the main results in provable cryptography. ...doi:10.1007/11617990_3 fatcat:6ujuzfhbhbfrnjouxkuxy2gd5i
The results show that a gain in performance is achieved when bit nodes are combined into quaternary symbol nodes. ... From the text: “Quantum error correction is one of the important requirements in both quantum computing and quantum commu- nication. ...
(English summary) Cryptography. Theoret. Comput. Sci. 226 (1999), no. 1-2, 29-36. ... In the model proposed, based on the Elias algorithm, the memory volume and time required for processing a single symbol is exponentially smaller than in previously known methods.” 2000k:94023 94A55 11T71 ...
I believe theorists and practitioners in cryptography will adopt formal methods more broadly. More specifically, formal methods can help theorists carry out mathematical proofs for security. ... With such (limited) success, the cryptography community has noted the advantages of applying formal methods. Better formal methods for cryptography will surely be developed in the near future. ...doi:10.1109/mc.2020.3033613 fatcat:qsrdehgerbakbibfkp7jpvx5wa
« Previous Showing results 1 — 15 out of 9,568 results