Administrative Appeal in Serbian Law
This paper addresses the issues of concept, features and place of the administrative appeal in Serbian administrative law. Special attention is given to the relation between administrative appeal and judicial review of administrative acts. The paper is part of a wider analysis regarding the effectiveness of administrative appeals in the framework of administrative justice on European level, put forward at the EGPA Conference in Toulouse in 2010. The paper is limited to scrutiny of normative aspects of administrative appeal, with the intention to be followed by an empirical research on its effectiveness.
Free Access to Information in Serbia
Serbia introduced the Free Access to Information of Public Importance Act (FOIA) (Official Gazette of the Republic of Serbia, no. 120/2004, 54/2007, 104/2009 and 36/2010) in 2004. The right to free access to information in public authorities’ possession has been elevated to a constitutional rank in 2006 (Art. 51, par. 2 of the Constitution) (Official Gazette of the Republic of Serbia, no. 98/2006). Transparency legislation has been completed by enactment of the Personal Data Protection Act (Official Gazette of the Republic of Serbia, no. 97/2008, 104/2009, 68/2012 and 107/2012) and the Secret Data Act (Official Gazette of the Republic of Serbia, no. 104/2009). This also rounded up the competence of the national access to information authority—the Commissioner for Free Access to Information of Public Importance and Personal Data Protection (hereinafter: Commissioner).
Rubik's for cryptographers
Hard mathematical problems are at the core of security arguments in cryptography. In this paper, we study mathematical generalizations of the famous Rubik’s cube puzzle, namely the factorization, representation and balance problems in non-Abelian groups. These problems arise naturally when describing the security of Cayley hash functions, a class of cryptographic hash functions with very interesting properties. The factorization problem is also strongly related to a famous long-standing conjecture of Babai, at the intersection of group theory and graph theory. A constructive proof of Babai’s conjecture would make all Cayley hash functions insecure, but on the other hand it would have many positive applications in graph theory and computer science. In this paper, we classify existing attacks against Cayley hash functions and we review known results on Babai’s conjecture. Despite recent cryptanalytic progress on particular instances, we show that the factorization, representation and balance problems presumably remain good sources of cryptographic hard problems. Our study demonstrates that Cayley hash functions deserve further interest by the cryptography community.