Filters








51,284 Hits in 5.6 sec

A New Digital Signature Scheme Based on Mandelbrot and Julia Fractal Sets

Mohammad Ahmad Alia, Azman Bin Samsudin
2007 American Journal of Applied Sciences  
This paper describes a new cryptographic digital signature scheme based on Mandelbrot and Julia fractal sets.  ...  Having fractal based digital signature scheme is possible due to the strong connection between the Mandelbrot and Julia fractal sets.  ...  This paper proposes a new fractal (based on Mandelbrot and Julia fractal sets) digital signature scheme as a secured method to sign and verify the corresponding message.  ... 
doi:10.3844/ajassp.2007.848.856 fatcat:7bm2aum54vhrtmmcvlwhqvc4xa

The Potential Energy of Texts [ΔU = -PΔV]

Craig Dworkin
2014 Iowa Review : literary quarterly  
, the talismanic sentence functions as a kind of secret code.  ...  repeated on the new sentence thus obtained, and so on." 13 René Étiemble was perhaps the first to recognize the poetic potential of such a procedure, opining, "Replaced by the definition given by an ingenious  ... 
doi:10.17077/0021-065x.7539 fatcat:dalhjgblmngf3osfacr3h6kmca

A code-based group signature scheme

Quentin Alamélou, Olivier Blazy, Stéphane Cauchie, Philippe Gaborit
2016 Designs, Codes and Cryptography  
Under the Random Oracle Model (ROM), we ensure the security of our scheme by defining the One More Syndrome Decoding problem, a new code-based problem related to the Syndrome Decoding problem [5].  ...  In a concurrent and independent work, [19] proposed a group signature scheme based on coding assumptions but only fitting the limited BMW model and with signatures and public key sizes linear in the number  ...  Our Code-Based Group Signature We now present our group-signature scheme satisfying Definition 4.  ... 
doi:10.1007/s10623-016-0276-6 fatcat:dbp7brdbs5hslptj5suxv7765e

A code-based blind signature

Olivier Blazy, Philippe Gaborit, Julien Schrek, Nicolas Sendrier
2017 2017 IEEE International Symposium on Information Theory (ISIT)  
In this paper we give the first blind signature protocol for code-based cryptography.  ...  The security of our blind protocol is based on the security of a trapdoor function for the syndrome decoding problem: the CFS signature scheme for Hamming distance and on the more recent RankSign protocol  ...  Our approach is completely new for coding theory, our scheme is generic for a given trapdoor function D H (). Our protocol is based on a concatenated version of the Stern protocol.  ... 
doi:10.1109/isit.2017.8007023 dblp:conf/isit/BlazyGSS17 fatcat:7xcox7uwc5cwdollffjadn2ara

Signatures for Network Coding

Denis Charles, Kamal Jain, Kristin Lauter
2006 2006 40th Annual Conference on Information Sciences and Systems  
This paper presents a practical digital signature scheme to be used in conjunction with network coding.  ...  Our scheme simultaneously provides authentication and detects malicious nodes that intentionally corrupt content on the network.  ...  In this paper we propose a different solution to the problem of detecting pollution attacks. We design a new homomorphic signature scheme for use with network coding.  ... 
doi:10.1109/ciss.2006.286587 fatcat:h4eedzeckjcvtoki77zmjq6ehi

Signatures for network coding

Denis Charles, Kamal Jain, Kristin Lauter
2009 International Journal of Information and Coding Theory  
This paper presents a practical digital signature scheme to be used in conjunction with network coding.  ...  Our scheme simultaneously provides authentication and detects malicious nodes that intentionally corrupt content on the network.  ...  In this paper we propose a different solution to the problem of detecting pollution attacks. We design a new homomorphic signature scheme for use with network coding.  ... 
doi:10.1504/ijicot.2009.024044 fatcat:owqjo2bwezff3pztchf7ni6to4

Secure Network Coding over the Integers [chapter]

Rosario Gennaro, Jonathan Katz, Hugo Krawczyk, Tal Rabin
2010 Lecture Notes in Computer Science  
-We give a homomorphic hashing scheme that is more efficient than existing schemes, and which leads to network coding signatures based on the hardness of factoring (in the standard model).  ...  We contribute to this area in several ways: -We show the first homomorphic signature scheme based on the RSA assumption (in the random oracle model).  ...  We present new and improved network coding signatures.  ... 
doi:10.1007/978-3-642-13013-7_9 fatcat:73xi2aa5zfcovd442ecxu2j7sm

Post-quantum Cryptography: Code-Based Signatures [chapter]

Pierre-Louis Cayrel, Mohammed Meziani
2010 Lecture Notes in Computer Science  
This survey provides a comparative overview of code-based signature schemes with respect to security and performance.  ...  Furthermore, we explicitly describe serveral code-based signature schemes with additional properties such as identity-based, threshold ring and blind signatures.  ...  and σ to V -If b = 1: P sends u ⊕ s and σ to V -If b = 2: P sends σ(u) and σ(s) to V Verification : - In 1995, Véron [42] proposed a dual version of Stern's scheme, which, unlike other schemes based  ... 
doi:10.1007/978-3-642-13577-4_8 fatcat:vji7yr5skjfjpnoaisoc3pg27a

On network coding for security

Keesook Han, Tracey Ho, Ralf Koetter, Muriel Medard, Fang Zhao
2007 MILCOM 2007 - IEEE Military Communications Conference  
In this paper, we overview the recent current theoretical understanding and application areas for network-coding based security in the areas of robustness to Byzantine attackers and of distributed signature  ...  schemes for downloads.  ...  Each node verifies the integrity of a received vector w by checking the membership of w in V based on the signature or(V).  ... 
doi:10.1109/milcom.2007.4454907 fatcat:euiub55s6fd7laqxo6goh43ije

Post-Quantum Cryptography: Code-based Signatures [article]

Pierre-Louis Cayrel, Mohammed Meziani
2013 arXiv   pre-print
This survey provides a comparative overview of code-based signature schemes with respect to security and performance.  ...  Furthermore, we explicitly describe serveral code-based signature schemes with additional properties such as identity-based, threshold ring and blind signatures.  ...  s scheme Kabatianskii, Krouk, and Smeets (KKS) [24] proposed a signature scheme based on arbitrary linear errorcorrecting codes.  ... 
arXiv:1312.4265v1 fatcat:kdsuxv6scrfbthtsxqldf4z6ae

Signatures for Content Distribution with Network Coding

Fang Zhao, Ton Kalker, Muriel Medard, Keesook J. Han
2007 2007 IEEE International Symposium on Information Theory  
In this paper, we propose such a signature scheme for network coding.  ...  However, such systems are very vulnerable to attacks by malicious nodes, and we need to have a signature scheme that allows nodes to check the validity of a packet without decoding.  ...  In this paper, we propose a new signature scheme that is not based on elliptic curves, and is designed specifically for random linear coded systems.  ... 
doi:10.1109/isit.2007.4557283 dblp:conf/isit/0001KMH07 fatcat:nxpszkbpujff3juuppqigwtl5a

Adaptive decorrelating detectors for CDMA systems

U. Mitra, H. V. Poor
1996 Wireless personal communications  
As CDMA based digital communication networks proliferate, the need to determine the presence of a new user and integrate knowledge of this new user into the detection scheme becomes more important.  ...  Several likelihood ratio based schemes are employed. Both synchronous and asynchronous communication are investigated.  ...  In Section 5, a scheme for accommodating asynchronous communication is described. The probability of detection error for the augmented decorrelator U. Mitra andH. V. Poor is discussed in Section 6.  ... 
doi:10.1007/bf01099344 fatcat:vu5et364avc73al2kgksvntez4

Adaptive decorrelating detectors for CDMA systems

U. Mitra, H. V. Poor
1995 Wireless personal communications  
As CDMA based digital communication networks proliferate, the need to determine the presence of a new user and integrate knowledge of this new user into the detection scheme becomes more important.  ...  Several likelihood ratio based schemes are employed. Both synchronous and asynchronous communication are investigated.  ...  In Section 5, a scheme for accommodating asynchronous communication is described. The probability of detection error for the augmented decorrelator U. Mitra andH. V. Poor is discussed in Section 6.  ... 
doi:10.1007/bf01099636 fatcat:j6rxbb7dgrarnh4pp2rfid5beq

Space frequency codes from spherical codes

O. Henkel
2005 Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.  
This is achieved by a lattice based construction of spherical codes, which permits lattice decoding algorithms and thus offers a substantial reduction of complexity.  ...  A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers.  ...  Note that the restriction on K for the Alamouti scheme underlines the need for new coding schemes, which are capable of meeting more general system requirements (K, L, n t ).  ... 
doi:10.1109/isit.2005.1523553 dblp:conf/isit/Henkel05 fatcat:e7gxxqkhurdjzj3eih4hwjdq54

Modified pqsigRM: RM Code-based Signature Scheme

Yongwoo Lee, Wijik Lee, Young-Sik Kim, Jong-Seon No
2020 IEEE Access  
This scheme is based on a modified Reed-Muller (RM) code, which reduces the signing complexity and key size compared with existing code-based signature schemes.  ...  Using a modified RM code, the proposed signature scheme resists various known attacks on RM-code-based cryptography.  ...  In this paper, a new code-based signature scheme using binary codes with a pU, U`V q-code as its subcode is proposed.  ... 
doi:10.1109/access.2020.3026989 fatcat:ozlmqazvojeznh5zh3mwcny2aq
« Previous Showing results 1 — 15 out of 51,284 results