|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
|
|
Results
Found 20 publication records. Showing 20 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Vadim Lyubashevsky, Chris Peikert, Oded Regev |
On Ideal Lattices and Learning with Errors Over Rings.  |
IACR Cryptology ePrint Archive  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Michel Abdalla, Dario Fiore, Vadim Lyubashevsky |
From Selective to Full Security: Semi-generic Transformations in the Standard Model. |
Public Key Cryptography |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky |
Lattice Signatures without Trapdoors. |
EUROCRYPT |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi |
Tightly-Secure Signatures from Lossy Identification Schemes. |
EUROCRYPT |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky |
Lattice Signatures Without Trapdoors. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Chris Peikert, Oded Regev |
On Ideal Lattices and Learning with Errors over Rings. |
EUROCRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Adriana Palacio, Gil Segev |
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. |
TCC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Adriana Palacio, Gil Segev |
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ishay Haviv, Vadim Lyubashevsky, Oded Regev |
A Note on the Distribution of the Distance from a Lattice. |
Discrete & Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
Second moment, Computational complexity, Lattices, Geometrical invariants, Covering radius |
| 1 | Vadim Lyubashevsky |
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. |
ASIACRYPT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Daniele Micciancio |
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. |
CRYPTO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky |
The nc-Unique Shortest Vector Problem is Hard. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen |
SWIFFT: A Modest Proposal for FFT Hashing. |
FSE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky |
Lattice-Based Identification Schemes Secure Under Active Attacks. |
Public Key Cryptography |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Daniele Micciancio |
Asymptotically Efficient Lattice-Based Digital Signatures. |
TCC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Daniele Micciancio |
Generalized Compact Knapsacks Are Collision Resistant. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio |
On Bounded Distance Decoding for General Lattices. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Daniele Micciancio |
Generalized Compact Knapsacks are Collision Resistant |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Vadim Lyubashevsky |
On Random High Density Subset Sums |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Vadim Lyubashevsky |
The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #20 of 20 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")