5 research outputs found
Exploring the Justice Paradox in Clemency for Narcotics Convicts: A Case Study of Banyuasin Class IIB Prison
Get PDFThe granting of clemency as a presidential prerogative within the Indonesian legal system has sparked considerable debate, particularly when applied to narcotics offenders classified as perpetrators of hard crimes. This study examines the case of Muhammad Aldin Purwanto, a narcotics convict who was granted clemency in the form of sentence reduction, despite having previously been sentenced to seven years' imprisonment for acting as an intermediary in the sale of a Schedule I narcotic substance. Clemency was granted on the grounds of good behavior and his role as the primary breadwinner for his family. This research aims to analyze the granting of clemency within the framework of justice, employing a normative juridical method with both conceptual and case study approaches. The study reveals a tension between the principle of retributive justice, which demands proportionate punishment for criminal acts, and the restorative justice approach, which emphasizes offender rehabilitation. The clemency granted in this case presents both a moral and legal dilemma, as it may be interpreted as a denial of retributive justice and a dilution of the meaning of criminal responsibility. The findings suggest that the absence of clear parameters for granting clemency creates vulnerabilities to policy deviation, potentially undermining the legitimacy of the criminal justice system itself. Therefore, a reformulation of clemency policy is necessary through clearer legal regulation, grounded in justice-based principles. Clemency should be guided by rational, objective, and balanced legal considerations that weigh both the rights of the convict and the public sense of justice
DIFFERENTIAL OPTICAL DISPERSION SPECTROSCOPY FOR COMPARATIVE MOLECULAR QUANTIFICATION
No full textAuthor Institution: Department of Electrical Engineering, Princeton University, Princeton, NJ, 08544, USAA new spectroscopic technique that is based on molecular dispersion spectroscopy \textbf{18}, 26123 (2010).} and enables new capabilities in chemical detection as compared to well-established laser absorption spectroscopy will be discussed in this paper. Differential optical dispersion spectroscopy (DODiS) enables simultaneous measurement and comparison of two gas samples. This is performed through simultaneous detection of molecular absorption that is additive and molecular dispersion that provides differential information about the samples. Therefore DODiS performs true optical addition/subtraction of absorption/dispersion spectra, which is a unique property not available with any conventional absorption-based techniques. The DODiS measurement principle and proof-of-concept experiments involving comparative measurements with a well-known reference gas mixture utilized as a real-time system calibration, as well as mitigation of unwanted spectral interference from other molecules achieved through DODiS optical subtraction will be presented
Two-Round Man-in-the-Middle Security from LPN
No full textSecret-key authentication protocols have recently received a considerable amount of attention, and a long line of research has been devoted to devising efficient protocols with security based on the hard- ness of the learning-parity with noise (LPN) problem, with the goal of achieving low communication and round complexities, as well as highest possible security guarantees.
In this paper, we construct 2-round authentication protocols that are secure against sequential man-in-the-middle (MIM) attacks with tight reductions to LPN, Field-LPN, or other problems. The best prior pro- tocols had either loose reductions and required 3 rounds (Lyubashevsky and Masny, CRYPTO’13) or had a much larger key (Kiltz et al., EURO- CRYPT’11 and Dodis et al., EUROCRYPT’12). Our constructions follow from a new generic deterministic and round-preserving transformation enhancing actively-secure protocols of a special form to be sequentially MIM-secure while only adding a limited amount of key material and computation.Peer reviewe
Identity-based ring signatures from RSA
No full text18 pages.-- Printed version published on Dec 10, 2007.Shamir proposed in 1984 the first identity-based signature scheme, whose security relies on the RSA problem. A similar scheme was proposed by Guillou and Quisquater in 1988. Formal security of these schemes was not argued and/or proved until many years later [D. Pointcheval, J. Stern, Security arguments for digital signatures and blind signatures, Journal of Cryptology 13 (3) (2000) 361–396; Y. Dodis, J. Katz, S. Xu, M. Yung, Strong key-insulated signature schemes, in: Proceedings of PKC’03, in: LNCS, vol. 2567, Springer-Verlag, 2002, pp. 130–144; M. Bellare, C. Namprempre, G. Neven, Security proofs for identity-based identification and signature schemes, in: Proceedings of Eurocrypt’04, in: LNCS, vol. 3027, Springer-Verlag, 2004, pp. 268–286].Taking the Guillou–Quisquater scheme as the starting point, we design and analyze in this work ring signature schemes and distributed ring signature schemes for identity-based scenarios whose security is based on the hardness of the RSA problem. These are the first identity-based ring signature schemes which do not employ bilinear pairings. Furthermore, the resulting schemes satisfy an interesting property: the real author(s) of a ring signature can later open the anonymity and prove that he is actually the person who signed the message.The work of the author was partially supported by Spanish Ministry of Education and Science, under projects TSI2007-
65406-C03-02 ("eAEGIS") and CONSOLIDER INGENIO 2010 CSD2007-00004 ("ARES").Peer reviewe
Non-malleable condensers for arbitrary min-entropy, and almost optimal protocols for privacy amplification
Get PDFRecently, the problem of privacy amplification with an active adversary has received a lot of attention. Given a shared n-bit weak random source X with min-entropy k and a security parameter s, the main goal is to construct an explicit 2-round privacy amplification protocol that achieves entropy loss O(s). Dodis and Wichs [DW09] showed that optimal protocols can be achieved by constructing explicit non-malleable extractors. However, the best known explicit non-malleable extractor only achieves k = 0.49n [Li12b] and evidence in [Li12b] suggests that constructing explicit non-malleable extractors for smaller min-entropy may be hard. In an alternative approach, Li [Li12a] introduced the notion of a non-malleable condenser and showed that explicit non-malleable condensers also give optimal privacy amplification protocols. In this paper, we give the first construction of non-malleable condensers for arbitrary min-entropy. Using our construction, we obtain a 2-round privacy amplification protocol with optimal entropy loss for security parameter up to s = Ω( k). This is the first protocol that simultane-ously achieves optimal round complexity and optimal entropy loss for arbitrary min-entropy k. We also generalize this result to obtain a protocol that runs in O(s/ k) rounds with optimal entropy loss, for security parameter up to s = Ω(k). This significantly improves the protocol in [CKOR10]. Finally, we give a better non-malleable condenser for linear min-entropy, and in this case obtain a 2-round protocol with optimal entropy loss for security parameter up to s = Ω(k), which improves the entropy loss and communication complexity of the protocol in [Li12b]. ∗Most work was done while the author was a Simons postdoctoral fellow at University of Washington.
