![]() | ![]() |
| 2012 | ||
|---|---|---|
| 68 | Majid Khabbazian, Ian F. Blake, Vijay K. Bhargava: Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions. IEEE Trans. Mob. Comput. 11(3): 402-413 (2012) | |
| 2011 | ||
| 67 | Ehsan Vahedi, Rabab K. Ward, Ian F. Blake: Security Analysis and Complexity Comparison of Some Recent Lightweight RFID Protocols. CISIS 2011: 92-99 | |
| 66 | Ehsan Vahedi, Vincent W. S. Wong, Ian F. Blake, Rabab K. Ward: Probabilistic Analysis and Correction of Chen's Tag Estimate Method. IEEE T. Automation Science and Engineering 8(3): 659-663 (2011) | |
| 65 | Ehsan Vahedi, Vahid Shah-Mansouri, Vincent W. S. Wong, Ian F. Blake, Rabab K. Ward: Probabilistic Analysis of Blocking Attack in RFID Systems. IEEE Transactions on Information Forensics and Security 6(3-1): 803-817 (2011) | |
| 2010 | ||
| 64 | Ehsan Vahedi, Vahid Shah-Mansouri, Vincent W. S. Wong, Ian F. Blake: A Probabilistic Approach for Detecting Blocking Attack in RFID Systems. ICC 2010: 1-6 | |
| 63 | Chris Studholme, Ian F. Blake: Random Matrices and Codes for the Erasure Channel. Algorithmica 56(4): 605-620 (2010) | |
| 62 | Ian F. Blake, Theodoulos Garefalakis: A transform property of Kloosterman sums. Discrete Applied Mathematics 158(10): 1064-1072 (2010) | |
| 61 | Li Zhang, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar, Ian F. Blake: Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares. IEEE Transactions on Communications 58(11): 3126-3139 (2010) | |
| 2008 | ||
| 60 | Ian F. Blake, Theodoulos Garefalakis: Polynomial approximation of bilinear Diffie-Hellman maps. Finite Fields and Their Applications 14(2): 379-389 (2008) | |
| 2007 | ||
| 59 | E. C. Park, Ian F. Blake: Reducing Communication Overhead of Key Distribution Schemes for Wireless Sensor Networks. ICCCN 2007: 1345-1350 | |
| 58 | Chris Studholme, Ian F. Blake: Multiparty Computation to Generate Secret Permutations. IACR Cryptology ePrint Archive 2007: 353 (2007) | |
| 2006 | ||
| 57 | Ian F. Blake, Vladimir Kolesnikov: Conditional Encrypted Mapping and Comparing Encrypted Numbers. Financial Cryptography 2006: 206-220 | |
| 56 | Ian F. Blake, Aldar C.-F. Chan: Conditionally Verifiable Signature. INDOCRYPT 2006: 206-220 | |
| 55 | Ian F. Blake, Theodoulos Garefalakis, Igor Shparlinski: On the bit security of the Diffie-Hellman key. Appl. Algebra Eng. Commun. Comput. 16(6): 397-404 (2006) | |
| 54 | Mehrdad Shamsi, Masoud Ardakani, Ian F. Blake: Mixed-Q linear space-time codes. IEEE Transactions on Communications 54(5): 849-857 (2006) | |
| 53 | Ian F. Blake, V. Kumar Murty, Guangwu Xu: Refinements of Miller's algorithm for computing the Weil/Tate pairing. J. Algorithms 58(2): 134-149 (2006) | |
| 52 | E. C. Park, Ian F. Blake: On the mean number of encryptions for tree-based broadcast encryption schemes. J. Discrete Algorithms 4(2): 215-238 (2006) | |
| 2005 | ||
| 51 | Aldar C.-F. Chan, Ian F. Blake: Scalable, Server-Passive, User-Anonymous Timed Release Cryptography. ICDCS 2005: 504-513 | |
| 50 | Aldar C.-F. Chan, Ian F. Blake: Conditionally Verifiable Signatures. IACR Cryptology ePrint Archive 2005: 149 (2005) | |
| 49 | Ian F. Blake, V. Kumar Murty, Guangwu Xu: A note on window tau-NAF algorithm. Inf. Process. Lett. 95(5): 496-502 (2005) | |
| 48 | Ian F. Blake, V. Kumar Murty, Guangwu Xu: Efficient algorithms for Koblitz curves over fields of characteristic three. J. Discrete Algorithms 3(1): 113-124 (2005) | |
| 2004 | ||
| 47 | Ian F. Blake, Vladimir Kolesnikov: Strong Conditional Oblivious Transfer and Computing on Intervals. ASIACRYPT 2004: 515-529 | |
| 46 | Ian F. Blake, Aldar C.-F. Chan: Scalable, Server-Passive, User-Anonymous Timed Release Public Key Encryption from Bilinear Pairing. IACR Cryptology ePrint Archive 2004: 211 (2004) | |
| 45 | Ian F. Blake, V. Kumar Murty, Guangwu Xu: Refinements of Miller's Algorithm for Computing Weil/Tate Pairing. IACR Cryptology ePrint Archive 2004: 65 (2004) | |
| 44 | Ian F. Blake, Theodoulos Garefalakis: On the complexity of the discrete logarithm and Diffie-Hellman problems. J. Complexity 20(2-3): 148-170 (2004) | |
| 2002 | ||
| 43 | Ian F. Blake, Theodoulos Garefalakis: On the Security of the Digital Signature Algorithm. Des. Codes Cryptography 26(1-3): 87-96 (2002) | |
| 42 | Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhong Gao: Finite Field Multiplier Using Redundant Representation. IEEE Trans. Computers 51(11): 1306-1316 (2002) | |
| 1999 | ||
| 41 | Ian F. Blake: Curves with Many Points and Their Applications. AAECC 1999: 55-64 | |
| 40 | Huapeng Wu, M. Anwarul Hasan, Ian F. Blake: Highly Regular Architectures for Finite Field Computation Using Redundant Basis. CHES 1999: 269-279 | |
| 39 | Amir H. Banihashemi, Ian F. Blake: On the trellis complexity of root lattices and their duals. IEEE Transactions on Information Theory 45(6): 2168-2172 (1999) | |
| 1998 | ||
| 38 | Huapeng Wu, M. Anwarul Hasan, Ian F. Blake: New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases. IEEE Trans. Computers 47(11): 1223-1234 (1998) | |
| 37 | Cecilio Pimentel, Ian F. Blake: Concatenated coding performance for FSK modulation on time-correlated Rician fading channels. IEEE Transactions on Communications 46(12): 1610-1618 (1998) | |
| 36 | Shraga I. Bross, Ian F. Blake: Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel. IEEE Transactions on Information Theory 44(1): 334-340 (1998) | |
| 35 | Amir H. Banihashemi, Ian F. Blake: Trellis Complexity and Minimal Trellis Diagrams of Lattices. IEEE Transactions on Information Theory 44(5): 1829-1847 (1998) | |
| 34 | Ian F. Blake, Chris Heegard, Tom Høholdt, V. Wei: Algebraic-Geometry Codes. IEEE Transactions on Information Theory 44(6): 2596-2618 (1998) | |
| 1997 | ||
| 33 | Cecilio Pimentel, Ian F. Blake: Non-Interleaved Reed-Solomon Coding Performance on Finite State Channels. ICC (3) 1997: 1493-1497 | |
| 32 | Muzhong Wang, Ian F. Blake: Normal basis of the finite field F2(p-1)pm over F2. IEEE Transactions on Information Theory 43(2): 737-739 (1997) | |
| 1996 | ||
| 31 | Christopher J. Wein, Ian F. Blake: On the performance of fractal compression with clustering. IEEE Transactions on Image Processing 5(3): 522-526 (1996) | |
| 30 | Vahid Tarokh, Ian F. Blake: Trellis complexity versus the coding gain of lattices I. IEEE Transactions on Information Theory 42(6): 1796-1807 (1996) | |
| 29 | Vahid Tarokh, Ian F. Blake: Trellis complexity versus the coding gain of lattices II. IEEE Transactions on Information Theory 42(6): 1808-1816 (1996) | |
| 28 | Ian F. Blake, Vahid Tarokh: On the Trellis Complexity of the Densest Lattice Packings in Rn. SIAM J. Discrete Math. 9(4): 597-601 (1996) | |
| 1995 | ||
| 27 | D. Dabiri, Ian F. Blake: Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials. IEEE Transactions on Information Theory 41(4): 873-885 (1995) | |
| 1994 | ||
| 26 | Tomik Yaghoobian, Ian F. Blake: Two New Decoding Algorithms for Reed-Solomon Codes. Appl. Algebra Eng. Commun. Comput. 5: 23-43 (1994) | |
| 25 | Ian F. Blake: Review of 'Source and Channel Coding: An Algorithmic Approach' (Anderson, J.B., and Mohan, S.; 1991). IEEE Transactions on Information Theory 40(1): 289- (1994) | |
| 24 | Ian F. Blake, Shuhong Gao, Ronald C. Mullin: Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b. SIAM J. Discrete Math. 7(3): 499-512 (1994) | |
| 1993 | ||
| 23 | Ian F. Blake, Shuhong Gao, Robert J. Lambert: Constructive problems for irreducible polynominals over finite fields. Information Theory and Applications 1993: 1-23 | |
| 22 | Ian F. Blake, Shuhong Gao, Ronald C. Mullin: Explicit Factorization of x2k + 1 over Fp with Prime p= 3 mod 4. Appl. Algebra Eng. Commun. Comput. 4: 89-94 (1993) | |
| 1992 | ||
| 21 | Tomik Yaghoobian, Ian F. Blake: Hermitian Codes as Generalized Reed-Solomon Codes. Des. Codes Cryptography 2(1): 5-17 (1992) | |
| 1991 | ||
| 20 | Ian F. Blake: A perspective on coding theory. Inf. Sci. 57-58: 111-118 (1991) | |
| 19 | Ian F. Blake, Khun Kith: On the Complete Weight Enumerator of Reed-Solomon Codes. SIAM J. Discrete Math. 4(2): 164-171 (1991) | |
| 1990 | ||
| 18 | Muzhong Wang, Ian F. Blake: Bit Serial Multiplication in Finite Fields. SIAM J. Discrete Math. 3(1): 140-148 (1990) | |
| 1989 | ||
| 17 | David W. Ash, Ian F. Blake, Scott A. Vanstone: Low complexity normal bases. Discrete Applied Mathematics 25(3): 191-210 (1989) | |
| 16 | Guillermo E. Atkin, Ian F. Blake: Performance of multitone FFH/MFSK systems in the presence of jamming. IEEE Transactions on Information Theory 35(2): 428-435 (1989) | |
| 1988 | ||
| 15 | George H. Freeman, Ian F. Blake, Jon W. Mark: Trellis source code design as an optimization problem. IEEE Transactions on Information Theory 34(5): 1226-1241 (1988) | |
| 1987 | ||
| 14 | Ian F. Blake, H. Darabian: Approximations for the probability in the tails of the binomial distribution. IEEE Transactions on Information Theory 33(3): 426-428 (1987) | |
| 1984 | ||
| 13 | Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone: Computing Logarithms in GF(2n). CRYPTO 1984: 73-82 | |
| 12 | Gordon L. Stüber, Jon W. Mark, Ian F. Blake: Sequence acquisition using bit estimation techniques. Inf. Sci. 32(3): 217-229 (1984) | |
| 1983 | ||
| 11 | Ian F. Blake: Review of 'Introduction to the Theory of Error-Correcting codes' (Pless, V.; 1982). IEEE Transactions on Information Theory 29(4): 63 (1983) | |
| 1982 | ||
| 10 | Ian F. Blake, Jon W. Mark: A note on complex sequences with low correlations. IEEE Transactions on Information Theory 28(5): 814-816 (1982) | |
| 9 | Ian F. Blake: The Enumeration of Certain Run-Length Sequences Information and Control 55(1-3): 222-236 (1982) | |
| 1979 | ||
| 8 | Reihaneh Safavi-Naini, Ian F. Blake: Generalized t-Designs and Weighted Majority Decoding Information and Control 42(3): 261-282 (1979) | |
| 7 | Ian F. Blake, Gérard D. Cohen, Mikhail Deza: Coding with Permutations Information and Control 43(1): 1-19 (1979) | |
| 1977 | ||
| 6 | Ian F. Blake, Alan G. Konheim: Big Buckets Are (Are Not) Better! J. ACM 24(4): 591-606 (1977) | |
| 1976 | ||
| 5 | Mushfiqur Rahman, Ian F. Blake: Combinatorial aspects of orthogonal parity checks (Corresp.). IEEE Transactions on Information Theory 22(6): 759-763 (1976) | |
| 1975 | ||
| 4 | Ian F. Blake: On a Generalization of the Pless Symmetry Codes Information and Control 27(4): 369-373 (1975) | |
| 3 | Ian F. Blake: Codes over Integer Residue Rings Information and Control 29(4): 295-300 (1975) | |
| 1972 | ||
| 2 | Ian F. Blake: Codes Over Certain Rings Information and Control 20(4): 396-404 (1972) | |
| 1971 | ||
| 1 | Ian F. Blake: The Leech Lattice as a Code for the Gaussian Channel Information and Control 19(1): 66-74 (1971) | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page