Adult learning and education policies in Germany, Portugal and Sweden: An analysis of national reports to CONFINTEA VI

The chapter presents a theoretical proposal of three analytical models of Adult Learning and Education (ALE) policies. Some analytical categories and the corresponding dimensions are organised according to the ALE rationale which is typical of each social policy model. Historical, cultural and educational features are mentioned in connexion with the different policy models and its interpretative capacity to making sense of policies and practices implemented in Germany, Portugal and Sweden. !e analysis includes the states of the art and the official representations of ALE produced by the respective national authorities through national reports which were presented to CONFINTEA VI (2009).

ADSNARK: Nearly practical and privacy-preserving proofs on authenticated data

We study the problem of privacy-preserving proofs on authenticated data, where a party receives data from a trusted source and is requested to prove computations over the data to third parties in a correct and private way, i.e., the third party learns no information on the data but is still assured that the claimed proof is valid. Our work particularly focuses on the challenging requirement that the third party should be able to verify the validity with respect to the specific data authenticated by the source — even without having access to that source. This problem is motivated by various scenarios emerging from several application areas such as wearable computing, smart metering, or general business-to-business interactions. Furthermore, these applications also demand any meaningful solution to satisfy additional properties related to usability and scalability. In this paper, we formalize the above three-party model, discuss concrete application scenarios, and then we design, build, and evaluate ADSNARK, a nearly practical system for proving arbitrary computations over authenticated data in a privacy-preserving manner. ADSNARK improves significantly over state-of-the-art solutions for this model. For instance, compared to corresponding solutions based on Pinocchio (Oakland’13), ADSNARK achieves up to 25× improvement in proof-computation time and a 20× reduction in prover storage space.