41 is the Largest Size of a Cap in PG(4,4) by Edel Y., Bierbrauer J.

By Edel Y., Bierbrauer J.

Show description

Read or Download 41 is the Largest Size of a Cap in PG(4,4) PDF

Similar international conferences and symposiums books

Deductive and Object-Oriented Databases: Third International Conference, DOOD'93 Phoenix, Arizona, USA, December 6–8, 1993 Proceedings

This quantity comprises the complaints of the 3rd foreign convention on Deductive and Object-Oriented Databases. Its valuable guiding principle is that the object-oriented and deductive paradigms for modeling, organizing, and processing information supplement one another, instead of competing, and that difficulties related to vast volumes of complicated facts can most sensible be solved by means of integrating the easiest of either methods.

KI 2001: Advances in Artificial Intelligence: Joint German/Austrian Conference on AI Vienna, Austria, September 19–21, 2001 Proceedings

This quantity comprises the contributions to the Joint German/Austrian Con- rence on Arti? cial Intelligence, KI 2001, which contains the twenty fourth German and the ninth Austrian convention on Arti? cial Intelligence. they're divided into the subsequent different types: – 2 contributions by means of invited audio system of the convention; – 29 authorized technical papers, of which five the place submitted as program papers and 24 as papers on foundations of AI; – four contributions by means of contributors of the economic day, in which businesses operating within the ?

Trustworthy Global Computing: Third Symposium, TGC 2007, Sophia-Antipolis, France, November 5-6, 2007, Revised Selected Papers

This e-book constitutes the completely refereed post-conference complaints of the 3rd Symposium on reliable international Computing, TGC 2007; it furthermore includes tutorials from the adjoining Workshop at the interaction of Programming Languages and Cryptography, either held in Sophia-Antipolis, France, in November 2007.

Public Key Cryptography - PKC 2007: 10th International Conference on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16-20, ... Computer Science / Security and Cryptology)

This booklet constitutes the refereed complaints of the tenth foreign convention on perform and thought in Public-Key Cryptography, PKC 2007, held in Beijing, China in April 2007. The 29 revised complete papers offered including 2 invited lectures have been conscientiously reviewed and chosen from 118 submissions.

Extra info for 41 is the Largest Size of a Cap in PG(4,4)

Example text

Org/2005/116 22. : Short signatures without random oracles. L. ) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004) 23. : Efficient selective-ID secure identity based encryption without random oracles. L. ) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223–238. au Abstract. A proxy signature scheme allows an entity to delegate its signing capability to another entity (proxy) in such a way that the proxy can sign messages on behalf of the delegator. Proxy signatures have found numerous practical applications such as distributed systems, mobile agent applications, etc.

Springer, Heidelberg (2004) 17. : Proxy Signature: Delegation Of the Power to Sign Messages. IEICE Trans. Fundamentals E79-A(9), 1338–1353 (1996) 18. : A Proposal of Short Proxy Signature Using Pairing. In: International Conference on Information Technology (ITCC 2005), pp. 631–635. IEEE Computer Society Press, Los Alamitos (2005) 19. : Extended Proxy Signatures for Smart Cards. , Mambo, M. ) ISW 1999. LNCS, vol. 1729, pp. 247–258. Springer, Heidelberg (1999) Identity-Based Proxy Signature from Pairings 31 20.

24 W. Wu et al. 1 Bilinear Pairing Let G1 be a cyclic additive group of prime order q, P is the generator of G1 , GT denotes a multiplicative group of the same order. Let e : G1 × G1 → GT be a bilinear pairing with the following properties: – e is bilinear: e(aP, bP ) = e(P, P )ab , for all a, b ∈ ZZ q . – e is non-degenerate: e(P, P ) = 1GT . – e is efficiently computable. We say G1 is a bilinear group if there exists a group GT , and a bilinear pairing e : G1 × G1 → GT as above, and e, and the group action in G1 and GT can be computed efficiently.

Download PDF sample

Rated 4.70 of 5 – based on 36 votes