Sciweavers

4377 search results - page 310 / 876
» Mass problems and randomness
Sort
View
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
15 years 11 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
EUROCRYPT
2001
Springer
15 years 11 months ago
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
Mireille Fouquet, Pierrick Gaudry, Robert Harley
FOCS
1993
IEEE
15 years 11 months ago
Simulated Annealing for Graph Bisection
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
Mark Jerrum, Gregory B. Sorkin
EDBT
2010
ACM
132views Database» more  EDBT 2010»
15 years 10 months ago
Turbo-charging hidden database samplers with overflowing queries and skew reduction
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...
Arjun Dasgupta, Nan Zhang 0004, Gautam Das
CMMR
2008
Springer
153views Music» more  CMMR 2008»
15 years 8 months ago
Dynamic Mapping Strategies for Expressive Synthesis Performance and Improvisation
Realtime musical expression through synthesis is notoriously dicult. The complete potential of a sound engine is traditionally available only at design time. In this paper two mapp...
Palle Dahlstedt