On the Impossibility of NIZKs for Disjunctive Languages From Commit-and-Prove NIZKs

Autor: Kyosuke Yamashita, Mehdi Tibouchi, Masayuki Abe

Publikováno v: IEEE Access, Vol 9, Pp 51368-51379 (2021)

This paper considers the problem of expanding a language class that can be proven by a non-interactive zero-knowledge proof system (NIZK) in a black-box manner in the common reference string model. Namely, given NIZKs for two languages, ${\mathcal L}

Externí odkaz: https://doaj.org/article/9adf2f6986f34a6286f29441eb7026d4

PEMBENTUKAN KEYAKINAN HAKIM DALAM PERKARA PIDANA DI LINGKUNGAN PERADILAN JAWA BARAT

Autor: Ijud Tajudin, Rully Herdita Ramadhani, Azadia Az Zahra

Publikováno v: Arena Hukum, Vol 13, Iss 2, Pp 348-368 (2020)

Abstract It is interesting to examine how a judge can convince himself that he has found the material truth of a criminal act. The purpose of this study is to find the measurement and criteria of judges' confidence in the evidentiary process of a tr

Externí odkaz: https://doaj.org/article/9a22a2c538a54066b59f99f527f1b3ee

Amicus Curiae In The Criminal Evidence System In Indonesia

Autor: Cesaltina Angela Soares, I Made Agus Mahendra Iswara

Publikováno v: Sociological Jurisprudence Journal, Vol 2, Iss 1, Pp 67-72 (2019)

The Criminal Procedure Code in Indonesia is not known to other parties, other than to law enforcement officers who represent victims (Investigators or Public Prosecutors), suspects (Legal advisors) and Judges. However, in civil law, there are known o

Externí odkaz: https://doaj.org/article/507df782024e454eb0d8c655225616db

Smooth Hash Proof System Based on the Learning With Errors Problem With Multi-Bit Key Output

Autor: Momeng Liu, Yupu Hu, Shanshan Zhang, Linming Gong

Publikováno v: IEEE Access, Vol 7, Pp 155143-155157 (2019)

Since hash proof system (HPS) can be utilized to build versatilely cryptographic schemes, the study on realizing this cryptographic primitive has been a very active research area. With the increasing concerns on the huge progress in quantum computing

Externí odkaz: https://doaj.org/article/14fe8e7a03a545d6810d182ad3898942

Mechanized Proofs of Adversarial Complexity and Application to Universal Composability: Journal pre-print: full version

Autor: Pierre-Yves Strub, Gilles Barthe, Adrien Koutsos, Benjamin Grégoire, Manuel Barbosa

Publikováno v: CCS 2021-ACM SIGSAC Conference on Computer and Communications Security
CCS 2021-ACM SIGSAC Conference on Computer and Communications Security, Nov 2021, Virtual Event, South Korea. pp.2541-2563, ⟨10.1145/3460120.3484548⟩
CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security
CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Nov 2021, Virtual Event, South Korea. pp.2541-2563, ⟨10.1145/3460120.3484548⟩
CCS

International audience; In this paper we enhance the EasyCrypt proof assistant to reason about computational complexity of adversaries. The key technical tool is a Hoare logic for reasoning about computational complexity (execution time and oracle ca

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b208fe87f394ab3c610c6a3ba5f9e67
https://doi.org/10.1145/3589962