[PDF] Top 20 On Composable Security for Digital Signatures
Has 10000 "On Composable Security for Digital Signatures" found on our website. Below are the top 20 most common "On Composable Security for Digital Signatures".
On Composable Security for Digital Signatures
... idealized security guarantee, has often gone unnoticed and even lead to flaws in proofs of higher-level schemes based on ...making security analyses in the original and modified frameworks ... See full document
46
Reassessing Security of Randomizable Signatures
... A very attractive feature for a signature scheme in such a context is called randomizability. It allows anyone to derive, from a valid signature σ, a new version σ 0 on the same message. To our knowledge, in a bilinear ... See full document
17
On the Security Notions for Homomorphic Signatures
... homomorphic signatures must be succinct, meaning that their size must be significantly smaller than the size of the input ...phic signatures are composable, in the sense that signatures ... See full document
19
On the Security Loss of Unique Signatures
... proving security of a unique signature scheme in the random oracle model; while such a reduction is not subject to Coron’s impossibility or variants thereof, it is still not linear-preserving (since its ... See full document
39
Stronger Security for Sanitizable Signatures
... Examples. Assume that a medical doctor signs a patient record with an SSS. The signed medical record can be sanitized by a server. It removes identifying information from the record before giving it to the accountant, ... See full document
18
Signatures of Viber Security Traffic
... Viber is one of the popular mobile applications that allows its users to communicate securely through internet connectivity on 3/4 G or WiFi. It is a product of Rakuten Inc. (Rakuten, 1997 (accessed 9-November-2016)) and ... See full document
13
Simulatable Channels: Extended Security that is Universally Composable and Easier to Prove
... formulating security in various areas of cryptography. However security definitions based on simulation are generally harder to work with than game based definitions, often resulting in more complicated ... See full document
34
On Black-Box Complexity of Universally Composable Security in the CRS model
... stand-alone security, where a single set of parties run a single execution of the ...the security of most cryptographic protocols proven in the stand-alone setting does not remain intact if many instances ... See full document
47
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
... A more significant difference arises in the context of corruption. In the full UC model, an ideal functionality is modeled as a subroutine of the main protocol instance. Therefore, parties “send” messages/inputs to an ... See full document
42
Digital Signatures in the Legal Market:
... Electronic Signatures in Global and National Commerce Act of 2000) and UETA (the Uniform Electronic Transactions Act) as “an electronic sound, symbol, or ...electronic signatures cannot ensure signer ... See full document
7
Formal Treatment of Privacy-Enhancing Credential Systems
... Brands’ signatures [Bra99, PZ13] practical solutions for privacy-ABCs exist and are currently deployed in several pilot projects [ABC, IRM, Tea10, ...of security defi- nitions for PABC systems is still ... See full document
71
Composable Security in the Tamper Proof Hardware Model under Minimal Complexity
... shares. Specifically, the OT tokens will generate this pair of strings by applying a PRF on an input sid ∥ ssid. Handling the PRF tokens. To reduce the number of PRF tokens we must ensure that the sender cannot create ... See full document
63
Enhanced Security of Attribute-Based Signatures
... The privacy in Definition 2.7 only states that the relation between the signature and the secret keys is hidden. In particular, an adversary can not determine which signer issued a signature. Another way to describe ... See full document
32
RECOMMENDATIONS FOR ORDINARY CAUSE AND SUMMARY APPLICATIONS n.m..
... It may not be necessary to change the rules in order to use digital signatures on documents lodged in process.. The rules do not stipulate manual or digital signature.[r] ... See full document
10
Verifiable Encryption of Digital Signatures and Applications
... Remark 2. The certified e-mail protocol presented above works for RSA sig- natures but can easily be extended to work for other schemes based on a sim- ilar setting such as Rabin and Guillou–Quisquater [Guillou and ... See full document
20
A FORMAL ANALYSIS OF EXCHANGE OF DIGITAL SIGNATURES
... their signatures directly to the third party, some effort is required to produce protocols that are fair, effective, and usefully minimize demands on the third ... See full document
250
Study of Undeniable Digital Signatures Schemes
... This paper provides an overview of some modern authentication techniques that helps in proving the genuineness of the message or document. The undeniable schemes not only protect the interests of both the parties, but ... See full document
5
Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security
... Oblivious Transfer Extension. We provide the first adaptively-secure protocols for OT Extension solely relying on the PRO assumption. In this regard we present two results, one corresponding to semi-honest setting and ... See full document
58
Less is More: Relaxed yet Composable Security Notions for Key Exchange
... Theorem 3 applies to TLS-EDH in TLS 1.0, TLS 1.1 and TLS 2.1, when ephemeral Diffie-Hellman is used to agree on the pre-master secret with mutual authentication and for all authenticated encryption methods for the secure ... See full document
35
EdDSA Over Galois Field GF(p^m) for Multimedia Data
... Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the ...its security is based on the intractability of some discrete logarithm ... See full document
7
Related subjects