MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Pseudo-signatures" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

16 documents found, showing 1 through 10. Next 10 →

ATOM

Concepts for C++0x
by Jeremy Siek Douglas, Douglas Gregor, Ronald Garcia, Jeremiah Willcock, Jaakko Järvi, Andrew Lumsdaine
… templates vs. new template parameters . . . . . . . . . . . . . . . . . . . . . . . 7 3.2.3 Pseudo-signatures…
Add To MetaCart

Concepts for C++0x (revision 1
by Douglas Gregor, Jeremy Siek, Jeremiah Willcock, Jaakko Järvi, Ronald Garcia, Andrew Lumsdaine — 2005 — ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, Programming Language C
… . . . . . . . . . . . . . . . . . . . . . . . . 7 3.3.2 Pseudo-signatures vs. valid expressions…
Cited by 5 (4 self) – Add To MetaCart

On expected constant-round protocols for Byzantine agreement
by Jonathan Katz, Chiu-yuen Koo — 2006 — In Advances in Cryptology — Crypto ’06
…-theoretic “pseudo-signatures” [40] to obtain statistical 4 security even against an unbounded adversary. (As…
Cited by 9 (4 self) – Add To MetaCart

On the security of RDSA
by Pierre-alain Fouque, Guillaume Poupard, Been Proposed I. Biehl, J. Buchmann, S. Hamdy, A. Meyer — 2003 — Advances in Cryptology - EUROCRYPT 2003, Lecture Notes in Computer Science
… in order to obtain some “pseudo-signatures” with small e. 3.2 Generic Algorithms for Computing Discrete…
Cited by 2 (1 self) – Add To MetaCart

The Finite Graph Problem for Two-Way Alternating Automata
by Mikolaj Bojanczyk — 2001 — IN FOSSACS 2001, VOLUME 2030 OF LNCS
…; v 0 ) 2 Eg, where E is the set of edges of the original tree T . Denition 3.2 (Pseudo-signature…
Cited by 2 (1 self) – Add To MetaCart

Mass Spectrum Labeling: Theory and Practice
by Z. Huang, L. Chen, J-y. Cai, D. Gross, D. Musicant, R. Ramakrishnan, J. Schauer, S. J. Wright
… in multiple groups) plus several “pseudo-signatures” obtained using non-negative weighted averages…
Add To MetaCart

Detectable Byzantine Agreement Secure Against Faulty Majorities
by Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith — 2002 — In 21st PODC
… keys for a pseudo-signature scheme among the players. Our construction for detectable precomputation…
Cited by 2 (2 self) – Add To MetaCart

Zero-error information and applications in cryptography
by Stefan Wolf, Jürg Wullschleger, Université De Montréal — 2004 — In Proceedings of 2004 IEEE Information Theory Workshop (ITW
… for deriving the exact condition under which so-called pseudo-signatures and broadcast among three players…
Cited by 1 (1 self) – Add To MetaCart

Evaluation may be easier than generation (Extended Abstract)
by Moni Naor — 1996 — In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
… never be generated by a signer following the protocol. There can be many such "pseudo-signatures…
Cited by 2 (0 self) – Add To MetaCart

Diagnosing Realistic Bridging Faults with Single Stuck-at Information
by David B. Lavo, Brian Chess , Tracy Larrabee, F. Joel Ferguson — 1998 — IN PROCEEDINGS OF INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN
… approach was presented by Millman, McCluskey, and Acken [33], in which pseudo-signatures for bridging…
Cited by 21 (6 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB