A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Non-Malleable Encryption: Simpler, Shorter, Stronger
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
In a seminal paper, Dolev et al. [15] introduced the notion of non-malleable encryption (NM-CPA). ...
Hence, to overcome such "malleability" problems, stronger forms of security are required. ...
Non-malleability (NM-CPA). ...
doi:10.1007/978-3-662-49096-9_13
fatcat:pteqfo5nbvdclkubuojhaj5o5q
Inception Makes Non-malleable Codes Stronger
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Our result is obtained by a series of black-box reductions starting from the non-malleable codes from [ADL14]. ...
A large body of the recent work has focused on various constructions of non-malleable codes in the split-state model. ...
For the purpose of conveniently defining continuous non-malleable codes, an even stronger notion called super-strong non-malleable codes has been considered in the literature [FMNV14, JW15]. ...
doi:10.1007/978-3-319-70503-3_10
fatcat:fpj5iwlwpzd6dmocwfenfh5a7y
A New Family of Practical Non-Malleable Diffie-Hellman Protocols
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Finally, it is direct that strong non-malleable independence is stronger than general non-malleable independence. ...
Outside Non-Malleability. ...
an efficient solver C for GDH problem also with non-negligible probability. ...
arXiv:1105.1071v5
fatcat:wldounfymvekdlwdvlhmymne3y
Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Roughly speaking, an encryption scheme is said to be non-malleable, if no adversary can modify a ciphertext so that the resulting message is meaningfully related to the original message. ...
We define approximate non-malleability by relaxing the security conditions and only requiring non-malleability to hold with high probability (over the choice of secret key), and show that any authentication ...
This forces any non-malleable scheme to use the first method outlined above, which is stronger than secrecy. ...
doi:10.1007/978-3-642-20728-0_2
fatcat:t5rcxtzugza4rifciu7oqfttpm
New and improved constructions of non-malleable cryptographic protocols
2005
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
This gives rise to a modular construction of non-malleable commitments and results in a somewhat simpler analysis. ...
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitments. ...
A formal proof proceeds along the lines of the proof of non-malleability (but is simpler.) ...
doi:10.1145/1060590.1060670
dblp:conf/stoc/PassR05
fatcat:xh6fxpf4irbr3angb7z7f5wupe
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
message, thus immediately breaking non-malleability. ...
[ADKO15] prove that in this case a non-malleable code 1. Set count 1 = 0, count 2 = 0. ...
For example, [CKM11] , in the context of designing UC secure protocols via tamperable hardware tokens, consider a variant of non-malleable codes which has deterministic encryption and decryption. ...
doi:10.1007/978-3-662-49896-5_31
fatcat:kglagswfbna3hdgguxnv5jbjoq
Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This is the notion of a non-malleable condenser introduced in [Li12a]. ...
While a non-malleable extractor requires the output to be close to uniform, a non-malleable condenser only requires the output to have enough min-entropy. Definition 1.4. ...
To better illustrate the key idea, we also give a slightly simpler 2-round protocol with optimal entropy loss, without using the non-malleable condenser. ...
doi:10.1007/978-3-662-46494-6_21
fatcat:dlhjn6ihurbdvjut34kr4j5abe
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
It is known that non-malleability is possible only for restricted classes of tampering functions. ...
The second construction is inspired by the recent works about non-malleable codes of Agrawal et al. ...
Since 2010, a line of works has established increasingly stronger results concerning the feasibility of non-malleable codes against different families of tampering functions. ...
doi:10.1007/978-3-319-72089-0_1
fatcat:can3cd3rdnhy5kyvsqtdqotn5m
Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Secondly, though the importance of secure encryption of single blocks is well known, the security of modes of encryption (used to encrypt multiple blocks) is often ignored. ...
We find certain neglected issues in the study of private-key encryption schemes. ...
Note that this differs from a non-malleability attack; in the case of non-malleability, the adversary does not know the plaintext corresponding to the "challenge" ciphertext. ...
doi:10.1007/3-540-44706-7_20
fatcat:g7ckubszore6xevz5sudwxsqia
Message Franking via Committing Authenticated Encryption
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We initiate the study of message franking, recently introduced in Facebook's end-to-end encrypted message system. ...
An implication of our results is the first proofs that several in-use symmetric encryption schemes are committing in the traditional sense. ...
Acknowledgments The authors would like to thank the anonymous reviewers of Crypto 2017 for their thoughtful comments, as well as Mihir Bellare for discussions about robust encryption and its relation to ...
doi:10.1007/978-3-319-63697-9_3
fatcat:mtorkdiehnekbpkufevqthpmou
Reducing Metadata Leakage from Encrypted Files and Communication with PURBs
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1806.03160v3 fatcat:3rnwmus2ibeurboopmh373yvjiOther Versions
Most encrypted data formats leak metadata via their plaintext headers, such as format version, encryption schemes used, number of recipients who can decrypt the data, and even the recipients' identities ...
the precise encryption software version and configuration the sender used. ...
Non-malleability By default, our encoding scheme does not ensure nonmalleability. ...
arXiv:1806.03160v4
fatcat:aesd5teyjrb2rbcoi4vnuui4ae
Concurrent Non-Malleable Commitments
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. ...
encryption). ...
Our definitions of non-malleability are somewhat stronger that the ones proposed by DDN [12] . ...
doi:10.1109/sfcs.2005.27
dblp:conf/focs/PassR05
fatcat:j6vkocjjzjfgng3usehto3uikq
mpENC Multi-Party Encrypted Messaging Protocol design document
[article]
2016
arXiv
pre-print
Preserved Fulltext
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 application/pdf.
Message encryption For now, message encryption is very simple. ...
The cipher we choose is malleable, to give better deniability when we publish ephemeral signature keys, similar to OTR [OTR-spec]. • MESSAGE_PAYLOAD -Ciphertext payload. ...
arXiv:1606.04598v1
fatcat:yygtbqrhffbzdnborlrr4kmine
Optimal Asymmetric Encryption and Signature Paddings
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
As a consequence, such a padding has to introduce both randomness and redundancy, which does not lead to an optimal encryption nor an optimal signature. ...
A few years ago, Coron et al. suggested the design of a common construction, a universal padding, which one could apply for both encryption and signature. ...
Non-malleability [26] says the adversary wins if it manages to forge a new signature. ...
doi:10.1007/11496137_18
fatcat:aztecsm5qbczhg7d6dld6sjr2y
A tapestry of identity-based encryption: practical frameworks compared
2008
International Journal of Applied Cryptography
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
This paper surveys the practical benefits and drawbacks of several identitybased encryption schemes based on bilinear pairings. ...
He has published extensively in the top cryptology conferences on a range of topics including signatures, encryption, foundations, and human-oriented cryptography. ...
We require the availability of three cryptographic hash functions viewed as random oracles: 3. a function H 3 : G t × {0, 1} × G × G → Z p to make the ciphertext non-malleable. ...
doi:10.1504/ijact.2008.017047
fatcat:2kxynfqh2jd25jvvnyb3wgqtry
« Previous
Showing results 1 — 15 out of 155 results