搜索结果: 1-15 共查到“军事学 Symbolic”相关记录20条 . 查询时间(0.093 秒)
Symbolic methods have been used extensively for proving security of cryptographic protocols in the Dolev-Yao model, and more recently for proving security of cryptographic primitives and constructions...
Formal Analysis of Vote Privacy using Computationally Complete Symbolic Attacker
Provable security Computationally complete symbolic attacke Vote privacy
2018/6/25
We analyze the FOO electronic voting protocol in the provable secu- rity model using the technique of Computationally Complete Symbolic Attacker (CCSA). The protocol uses commitments, blind signatures...
Symbolic Side-Channel Analysis for Probabilistic Programs
Side-Channel Attacks Quantitative Information Flow Symbolic Execution
2018/4/11
In this paper we describe symbolic side-channel analysis techniques for detecting and quantifying information leakage, given in terms of Shannon and Min Entropy. Measuring the precise leakage is chall...
Symbolic security of garbled circuits
symbolic cryptography garbled circuit formal methods in cryptography
2018/2/8
We present the first computationally sound symbolic analysis of Yao's garbled circuit construction for secure two party computation. Our results include an extension of the symbolic language for crypt...
Symbolic Security Criteria for Blockwise Adaptive Secure Modes of Encryption
Modes of encryption symbolic analysis
2017/11/28
Symbolic methods for reasoning about the security of cryptographic systems have for some time concentrated mainly on protocols. More recently, however, we see a rising interest in the use of symbolic ...
Symbolic Security Criteria for Blockwise Adaptive Secure Modes of Encryption
Modes of encryption symbolic analysis
2017/11/28
Symbolic methods for reasoning about the security of cryptographic systems have for some time concentrated mainly on protocols. More recently, however, we see a rising interest in the use of symbolic ...
Symbolic Models for Isolated Execution Environments
isolated execution environments trusted hardware symbolic models
2017/2/20
Isolated Execution Environments (IEEs), such as ARM TrustZone and Intel SGX, offer the possibility to execute sensitive code in isolation from other malicious programs, running on the same machine, or...
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability
formal verification computational security guarantees
2016/1/27
In recent years, a new approach has been developed for verifying security protocols with the aim of combining the benefits of symbolic attackers and the benefits of unconditional soundness: the techni...
Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption
Cryptographic protocols Security analysis
2014/3/12
We consider a class of two-party function evaluation protocols in which the parties are allowed to use ideal functionalities as well as a set of powerful primitives, namely commitments, homomorphic en...
Symbolic Universal Composability
universal composability symbolic cryptography virtual primitives
2013/2/21
We introduce a variant of the Universal Composability framework (UC; Canetti, FOCS 2001) that uses symbolic cryptography. Two salient properties of the UC framework are secure composition and the poss...
Private-key Symbolic Encryption
Symbolic Encryption Hidden Assumptions Formal Security Model
2012/3/23
Symbolic encryption, in the style of Dolev-Yao models, is ubiquitous in formal security analysis aiming at the automated verification of network protocols. The naive use of symbolic encryption, howeve...
Computationally Sound Symbolic Security Reduction Analysis of Group Key Exchange Protocol using Bilinear Pairings
Universally Composable Symbolic Analysis Computational Soundness Bilinear Pairings Group Key Exchange Protocol Forward Secrecy
2012/3/26
Canetti and Herzog have proposed a universally composable symbolic analysis (UCSA) of mutual authentication and key exchange protocols within universally composable security framework. It is fully aut...
Universally Composable Symbolic Analysis of Diffie-Hellman based Key Exchange
cryptographic protocols Automated Proofs Universal Composition Diffie-Hellman key exchange forward secrecy
2010/7/13
Canetti and Herzog (TCC'06) show how to efficiently perform fully automated, computationally sound security analysis of key exchange protocols with an unbounded number of sessions. A key tool in their...
In the present paper we study properties of perfectly balanced Boolean functions. Based on the concept of Boolean function barrier, we propose a novel approach to construct large classes of perfectly ...
Pseudo-randomness and partial information in symbolic security analysis
Computational soundness formal methods for security pseudo-random generators
2009/6/15
We prove computational soundness results for cryptographic expressions with pseudo-random keys, as
used, for example, in the design and analysis of secure multicast key distribution protocols. In par...