Result 1 to 20 of 44 total
io-port 06073678 Aszalós, László;
Bátfai, Norbert;
Csirmaz, László;
Folláth, János;
Hajdúné Pocsai, Enikő;
Herendi, Tamás;
Kovács, Tünde;
Matolcsy, Zoltán;
Pethő, Attila;
Varga, Péter
Secure utilization of local and regional data assets through mobile environments. (English)
Egri-Nagy, Attila (ed.) et al., Proceedings of the 8th international conference on applied informatics (ICAI 2010), Eger, Hungary, January 27‒30, 2010. 2 Volumes. Eger: BVB Nyomda és Kiadó Kft. (ISBN 978-963-9894-72-3/pbk). 265-272 (2012).
1
Complexity of universal access structures. (English)
Inf. Process. Lett. 112, No. 4, 149-152 (2012).
2
On-line secret sharing. (English)
Des. Codes Cryptography 63, No. 1, 127-147 (2012).
3
How to share secrets simultaneously (English)
IACR Cryptology ePrint Archive 2011, 386 (2011).
4
Complexity of universal access structures (English)
IACR Cryptology ePrint Archive 2011, 375 (2011).
5
On-line secret sharing (English)
IACR Cryptology ePrint Archive 2011, 174 (2011).
6
Corrigendum to secret sharing on infinite graphs. (English)
Tatra Mt. Math. Publ. 47, 137-138 (2010).
7
An impossibility result on graph secret sharing. (English)
Des. Codes Cryptography 53, No. 3, 195-209 (2009).
8
On an infinite family of graphs with information ratio $2 - 1/k$. (English)
Computing 85, No. 1-2, 127-136 (2009).
9
Secret sharing on trees: problem solved (English)
IACR Cryptology ePrint Archive 2009, 71 (2009).
10
On the impossibility of graph secret sharing (English)
IACR Cryptology ePrint Archive 2009, 59 (2009).
11
Secret sharing on infinite graphs. (English)
Tatra Mt. Math. Publ. 41, 1-18 (2008).
12
Secret sharing schemes on graphs. (English)
Stud. Sci. Math. Hung. 44, No. 3, 297-306 (2007).
13
Secret sharing on the infinite ladder (English)
IACR Cryptology ePrint Archive 2007, 355 (2007).
14
Secret sharing on infinite graphs (English)
IACR Cryptology ePrint Archive 2007, 297 (2007).
15
Geometric codes. (Hungarian)
Alkalmazott Mat. Lapok 23, No. 2, 349-361 (2006).
16
Subpixel image processing. (Hungarian)
Alkalmazott Mat. Lapok 23, No. 1, 85-98 (2006).
17
Connected graph game. (English)
Stud. Sci. Math. Hung. 39, No.1-2, 129-136 (2002).
18
The size of a share must be large. (English)
J. Cryptology 10, No.4, 223-231 (1997).
19
The dealer’s random bits in perfect secret sharing schemes. (English)
Stud. Sci. Math. Hung. 32, No.3-4, 429-437 (1996).
20
Result 1 to 20 of 44 total
Start
Contact
Print
General Help
