Blockchain Papers

Follow blockchain research across journals, conferences, and preprint repositories.

63 papersLast indexed Aug 31, 2026
Search papers

Paper index

63 results · page 3 of 3

Clear filters
Nov 12, 2021·Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security
36 cites
Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k

Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Benoît Razet · 5 authors

Zero-knowledge proofs are highly flexible cryptographic protocols that are an important building block for many secure systems. Typically, these are defined with respect to statements that are formulated as arithmetic operations over a fixed finite field. This inflexibility is a disadvantage when it comes to complex programs, as some fields are more amenable to express certain operations than others. At the same time, there do not seem to be many proofs with a programming model similar to those found in modern computer architectures that perform arithmetic with 32 or 64 bit integers.

Open access
Cryptography and Data Security
Cryptography and Residue Arithmetic
Numerical Methods and Algorithms
Original source
Jan 1, 2011·MAA spectrum
0 cites
Zero Knowledge Proofs, Stephen G. Krantz

Tatiana Shubin, Gerald L. Alexanderson, David Hayes

No abstract is available for this record.

Logic, Reasoning, and Knowledge
Numerical Methods and Algorithms
Computability, Logic, AI Algorithms
Original source
Jan 1, 2011·IIUM Press eBooks
15 cites
Zero-Knowledge Proof

Imad Fakhri Taha Alshaikhli, Rusydi Hasan Makarin, Siti Khairunnisa Mohd Bakri, Nur Dalilah More Yusoff · 5 authors

Much of the current innovation in advanced materials is occurring at the nanoscale, specifically in manufactured nanomaterials (MNs). MNs display unique attributes and behaviors, and may be biologically and physically unique, making them valuable across a wide range of applications. However, as the number, diversity and complexity of MNs coming to market continue to grow, assessing their health and environmental risks with traditional animal testing approaches is too time- and cost-intensive to be practical, and is undesirable for ethical reasons. New approaches are needed that meet current requirements for regulatory risk assessment while reducing reliance on animal testing and enabling safer-by-design product development strategies to be implemented. The adverse outcome pathway (AOP) framework presents a sound model for the advancement of MN decision making. Yet, there are currently gaps in technical and policy aspects of AOPs that hinder the adoption and use for MN risk assessment and regulatory decision making. This review outlines the current status and next steps for the development and use of the AOP framework in decision making regarding the safety of MNs. Opportunities and challenges are identified concerning the advancement and adoption of AOPs as part of an integrated approach to testing and assessing (IATA) MNs, as are specific actions proposed to advance the development, use and acceptance of the AOP framework and associated testing strategies for MN risk assessment and decision making. The intention of this review is to reflect the views of a diversity of stakeholders including experts, researchers, policymakers, regulators, risk assessors and industry representatives on the current status, needs and requirements to facilitate the future use of AOPs in MN risk assessment. It incorporates the views and feedback of experts that participated in two workshops hosted as part of an Organization for Economic Cooperation and Development (OECD) Working Party on Manufactured Nanomaterials (WPMN) project titled, "Advancing AOP Development for Nanomaterial Risk Assessment and Categorization", as well as input from several EU-funded nanosafety research consortia.

Open access
3 source records
Adversarial Robustness in Machine Learning
Cryptography and Data Security
Security and Verification in Computing
Original source
Nov 11, 2002·Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems (Cat.No.CH37144)
2 cites
On the stability of coupled-form state-space digital filters with quantization before summation

Mário Sarcinelli-Filho, Francisco C. Mota

The problem of suppressing zero-input limit cycles in coupled-form state-space digital filters when the quantization is performed after the multiplication is addressed. To the extent of the authors' knowledge, no proof has been presented that the parasitic oscillations are suppressed for poles anywhere in the unit circle, under that condition. Some authors have addressed this subject, but their results constrain the poles to a bounded region inside the unit circle. With the objective of exploring this topic further, the authors present a proof that for poles whose angle is either 0, /spl plusmn/45, /spl plusmn/90, /spl plusmn/135 or 180 degrees and whose radius is lower than one, the second-order state-space coupled-form digital filter is free of zero-input limit cycles when quantizers placed just after the multipliers implement magnitude truncation.

Digital Filter Design and Implementation
Analog and Mixed-Signal Circuit Design
Numerical Methods and Algorithms
Original source
Aug 6, 2001·Cambridge University Press eBooks
5 cites
Zero-Knowledge Proof Systems

Josef Pieprzyk, Thomas Hardjono, Jennifer Seberry

Summary A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

Open access
4 source records
Numerical Methods and Algorithms
Logic, Reasoning, and Knowledge
Advanced Database Systems and Queries
Original source
Sep 1, 1991·Journal of Symbolic Logic
0 cites
Review: Shafi Goldwasser, Silvio Micali, Charles Rackoff, The Knowledge Complexity of Interactive Proof Systems ; Oded Goldreich, Silvio Micali, Avi Wigderson, J. Gruska, B. Rovan, J. Wiedermann, Proofs that Release Minimum Knowledge ; Oded Goldreich, Rolf Herken, Randomness, Interactive Proofs, and Zero-Knowledge--A Survey

Lance Fortnow

No abstract is available for this record.

Computability, Logic, AI Algorithms
Numerical Methods and Algorithms
Original source
Oct 1, 1987·Information security and cryptography
11 cites
Zero-Knowledge Proofs

Johannes Sedlmeir, Steffen Schwalm

Zero knowledge protocols provide a way of proving that a statement is true without revealing anything other than the correctness of the claim. Zero knowledge protocols have practical applications in cryptography and are used in many applications. While some applications only exist on a specification level, a direction of research has produced real-world applications. Zero knowledge protocols, also referred to as zero knowledge proofs, are a type of protocol in which one party, called the prover, tries to convince the other party, called the verifier, that a given statement is true. Sometimes the statement is that the prover possesses a particular piece of information. This is a special case of zero knowledge protocol called a zero-knowledge proof of knowledge. Formally, a zero-knowledge proof is a type of interactive proof.

13 source records
Computability, Logic, AI Algorithms
Cryptography and Data Security
Advanced Authentication Protocols Security
Original source