Sciweavers

139 search results - page 2 / 28
» Reducibilities Relating to Schnorr Randomness
Sort
View
MLQ
1998
84views more  MLQ 1998»
14 years 9 months ago
Arithmetical Measure
We develop arithmetical measure theory along the lines of Lutz [10]. This yields the same notion of “measure 0 set” as considered before by Martin-L¨of, Schnorr, and others. W...
Sebastiaan Terwijn, Leen Torenvliet
ISTCS
1995
Springer
15 years 1 months ago
Computation of Highly Regular Nearby Points
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
Carsten Rössner, Claus-Peter Schnorr
81
Voted
CORR
2004
Springer
104views Education» more  CORR 2004»
14 years 9 months ago
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
David Jao, Stephen D. Miller, Ramarathnam Venkates...
COCOON
2005
Springer
14 years 11 months ago
Solovay Reducibility on D-c.e Real Numbers
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The...
Robert Rettinger, Xizhong Zheng
CTRSA
2005
Springer
154views Cryptology» more  CTRSA 2005»
15 years 3 months ago
Fast and Proven Secure Blind Identity-Based Signcryption from Pairings
We present the first blind identity-based signcryption (BIBSC). We formulate its security model and define the security notions of blindness and parallel one-more unforgeability ...
Tsz Hon Yuen, Victor K. Wei