Cryptology ePrint Archive

?

Channel Reputation Rank

#32
?

Activity Status

Alive

last updated

According to the data and stats that were collected, 'Cryptology ePrint Archive' channel has an outstanding rank. The channel mostly uses medium-length articles along with sentence constructions of the advanced readability level, which is a result that may indicate difficult texts on the channel, probably due to a big amount of industrial or scientific terms.

About 'Cryptology ePrint Archive' Channel

The Cryptology ePrint Archive provides rapid access to recent research in cryptology. Papers have been placed here by th...

? Updates History Monthly Yearly
JavaScript chart by amCharts 3.13.1Jul, 2024Aug, 2024Sep, 2024Oct, 2024Nov, 2024Dec, 2024Jan, 2025Feb, 2025Mar, 2025Apr, 2025May, 2025Jun, 2025050100150200250300Show all
? Content Ratio
JavaScript chart by amCharts 3.13.1Texts
? Average Article Length

Medium-length materials prevail on 'Cryptology ePrint Archive' that may be an effective tactic to grip their readers’ attention with a wider range of helpful content. There are also longer items making up more than one third of all articles, which can provide a deeper insight into their subjects. Moreover, there are a few short articles.

short

long

? Readability Level

Advanced readability level of 'Cryptology ePrint Archive' content is probably targeted at well-educated subscribers as not all readers might clearly understand their texts. There are also some articles with medium readability level.

advanced

basic

? Sentiment Analysis

Positive emotional expressions prevail throughout the texts: they may include favorable reviews, appreciation or praise in regard to the subjects addressed on the channel. However, the channel also contains some rather negative or critical records that make up just a small amount of all its content.

positive

negative

Recent News
Computational Attestations of Polynomial Integrity Towards Verifiable Back-Propagation

Recent advancements in machine learning accuracy and utility have been driven by the effective combination of sophisticated models with high-performance...

+
Hydrangea: Optimistic Two-Round Partial Synchrony with One-Third Fault Resilience

We present Hydrangea, a partially synchronous Byzantine fault-tolerant state machine replication protocol that achieves a latency of two rounds optimistically...

+
SEAF: Secure Evaluation on Activation Functions with Dynamic Precision for Secure Two-Party Inference

Secure evaluation of non-linear functions is one of the most expensive operations in secure two-party computation, particularly for activation functions...

+
A Framework for Compiling Custom Languages as Efficiently Verifiable Virtual Machines

In this work, we develop a framework for compiling languages into efficient Interactive Oracle Proofs (IOPs, or ‘circuits’), motivated by applications...

+
Kahrobaei--Koupparis DSS: universal forgery

Regardless of the choice of parameters, knowledge of a single signed message, i.e., a pair message/signature, produced by Kahrobaei-Koupparis digital...

+
Laconic PSI on Authenticated Inputs and Applications

A common issue with using secure computation in practice is that its security does not place any restrictions on what an adversary can use as input in...

+
Early Stopping is Cheap

Minimizing both the round and communication complexity of Byzantine agreement (BA) is fundamental question in distributed computing. A long line of works...

+
b4M: Holistic Benchmarking for MPC

Secure Multi-Party Computation (MPC) is becoming more and more usable in practice. The practicality origins primarily from well-established general-purpose...

+
Low-cost anonymous reputation update for IoT applications

This paper presents a novel approach to zero-trust anonymous reputation update in crowd sensing IoT applications. We use a suite of cryptographic functions...

+
Better GBFV Bootstrapping and Faster Encrypted Edit Distance Computation

We propose a new iterative method to convert a ciphertext from the Generalized BFV (GBFV) to the regular BFV scheme. In particular, our conversion starts...

+
Universally Composable Succinct Vector Commitments and Applications

We develop a toolbox for modular construction and analysis of succinct, non-interactive commitments and vector commitments in the random oracle model...

+

Unfortunately Cryptology ePrint Archive has no news yet.

But you may check out related channels listed below.

? Locations

Related channels

  • Open Research Online: No conditions. Results ordered -Date Deposited.

    Open research Online. This archive contains material related to the research output of The Open University in the UK. Mo...

  • Mashable

    Mashable is a leading source for news, information & resources for the Connected Generation. Mashable reports on the imp...

  • Free Vector Archive

    Free vector art and graphics archive

  • E27

    Internet, Startups, Business, Investments and Tech in Asia

  • OUR Archive

    The Otago University Research Archive digital repository system captures, stores, indexes, preserves, and distributes di...