Sciweavers

1094 search results - page 138 / 219
» List signature schemes
Sort
View
PODC
1997
ACM
13 years 12 months ago
Implementing Wait-Free Objects on Priority-Based Systems
Wait-free objects are often implemented through the use of a \helping scheme", whereby one process \helps" one or more other processes to complete an operation. This pap...
James H. Anderson, Srikanth Ramamurthy, Rohit Jain
IACR
2011
173views more  IACR 2011»
12 years 7 months ago
All-But-Many Lossy Trapdoor Functions
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
Dennis Hofheinz
AAECC
1993
Springer
94views Algorithms» more  AAECC 1993»
13 years 11 months ago
Relations Among Lie Formal Series and Construction of Symplectic Integrators
Symplectic integrators are numerical integration schemes for hamiltonian systems. The integration step is an explicit symplectic map. We find symplectic integrators using universa...
Pierre-Vincent Koseleff
DATE
2004
IEEE
131views Hardware» more  DATE 2004»
13 years 11 months ago
Testing of Quantum Dot Cellular Automata Based Designs
There has been considerable research on quantum dots cellular automata as a new computing scheme in the nano-scale regimes. The basic logic element of this technology is a majorit...
Mehdi Baradaran Tahoori, Fabrizio Lombardi
EUROCRYPT
2010
Springer
14 years 15 days ago
Cryptographic Agility and Its Relation to Circular Encryption
We initiate a provable-security treatment of cryptographic agility. A primitive (for example PRFs, authenticated encryption schemes or digital signatures) is agile when multiple, ...
Tolga Acar, Mira Belenkiy, Mihir Bellare, David Ca...